The dot-depth hierarchy of star-free languages is infinite
- 1 February 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 16 (1) , 37-55
- https://doi.org/10.1016/0022-0000(78)90049-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Piecewise testable eventsPublished by Springer Nature ,1975
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971
- Dot-depth of star-free eventsJournal of Computer and System Sciences, 1971
- On finite monoids having only trivial subgroupsInformation and Control, 1965