OPEN PROBLEMS ABOUT REGULAR LANGUAGES11Research supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-1617. Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
- 1 January 1980
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- The dot-depth hierarchy of star-free languages is infiniteJournal of Computer and System Sciences, 1978
- Rank-non-increasing transformations on transition graphsInformation and Control, 1972
- Techniques for establishing star height of regular setsTheory of Computing Systems, 1971
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971
- General properties of star height of regular eventsJournal of Computer and System Sciences, 1970
- Star height of certain families of regular eventsJournal of Computer and System Sciences, 1970
- On Decompositions of Regular EventsJournal of the ACM, 1969
- Transition graphs and the star height problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- On a question of EgganInformation and Control, 1966
- Transition graphs and the star-height of regular events.The Michigan Mathematical Journal, 1963