Hierarchies of aperiodic languages

 Access to full text

 Full (PDF)

1. [1] Brzozowski ( J.A.). - Canonical regular expressions and minimal state graphs for definite events, "Mathematical theory of automata"New York, 1962, p. 529-561. - Brooklyn, Polytechnic Institute of Brooklyn, 1963(Symposia Series, 12). Zbl0116.33605MR175719
2. [2] Brzozowski ( J.A.). - J-trivial monoids and alphabetic languages over two letters (unpublished manuscript, February 1975). 
3. [3] Brzozowski ( J.A.), Culik II ( K.) and Gabrielian ( A.). - Classification of noncounting events, J. Computer and System Sc., t. 5, 1971, p. 41-53. Zbl0241.94050MR286578
4. [4] Brzozowski ( J.A.) and Simon ( I.). - Characterisations of locally testable events, Discrete Mathematics, t. 4, 1973, p. 243-271. Zbl0255.94032MR319404
5. [5] Cohen ( R.S.) and Brzozowski ( J.A.). - Dot-depth of star-free events, J. Computer and System. Sc., t. 5, 1971, p. 1-16. Zbl0217.29602MR309676
6. [6] Eilenberg ( S.). - Automata, languages, and machines, vol. A. - New York, Academic Press, 1974 Zbl0317.94045MR530382
7. (Pure and applied Mathematics Sciences, 59). Zbl0939.00001
8. [7] Eilenberg ( S.). - Automata, languages and machines, vol. B (in press). Zbl0359.94067
9. [8] Ginzburg ( A.). - About some properties of definite, reverse definite and related automata, IEEE Trans. Electronic Computers EC-15, 1966, p. 806-810. Zbl0156.01904
10. [9] Kleene ( S.C.). - Representation of events in nerve nets and finite automata, "Automata Studies", Edited by C.E. Shannon and J. McCarthy, p. 3-41. - Princeton, Princeton University Press, 1954 MR77478
11. (Annals of Mathematics Studies, 34). Zbl0184.48903
12. [10] McNaughton ( R.). - Algebraic decision procedures for local testability, Math. Systems Theory, t. 8, 1974, p. 60-76. Zbl0287.02022MR392544
13. [11] McNaughton ( R.) and Papert ( S.). - Counter-free automata. - Cambridge, The MIT Press, 1971 Zbl0232.94024MR371538
14. (M. I. T. Research Monographs, 65). 
15. [12] Meyer ( A.R.). - A note on star-free events, J. Assoc. Comp. Machin., t. 16, 1969, p. 220-225. Zbl0224.94060MR238624
16. [13] Perles ( M.), Rabin ( O.) and Shamir ( E.). - The theory of definite automata, IEEE Trans. Electronic Computers EC-12, 1963, p. 233-243. Zbl0158.01002MR153518
17. [14] Perrin ( D.). - Sur certains semigroupes syntaxiques (unpublished manuscript, February 1971). 
18. [15] Schützenberger ( M.P. ) . - On finite monoids having only trivial subgroups, Inform. and Control, t. 8, 1965, p. 190-194. Zbl0131.02001MR176883
19. [16] Schützenberger ( M.P.). - On a family of sets related to McNaughton's L-language, "Automata theory", Edited by E.R. Caianiello, p. 320-324. - New York, Academic Press, 1966. Zbl0192.07902MR219365
20. [17] Steinby ( M.). - On definite automata and related systems, Ann. Acad. Scient. Fennicae, Series A. I., 1969, n° 444, 57 p. Zbl0253.94030MR258541
21. [18] Simon ( I.). - Hierarchies of events with dot-depth one, Ph. D. Thesis, Dept. appl. Analysis and Computer Sc., Univ. Waterloo (Canada), 1972. 
22. [19] Zalcstein ( Y.). - Locally testable languages, J. Computer and System Sc., t. 6, 1972, p. 151-167. Zbl0242.68038MR307538
23. [20] Zalcstein ( Y.). - Locally testable semigroups, Semigroup Forum, t. 5, 1973. p. 216-227. Zbl0273.20049MR320194
24. [21] Zalcstein ( Y.). - Syntactic semigroups of some classes of star-free languages, "Automata, languages and programming", Proceedings of a symposium, Rocquencourt, 1972, p. 135-144. - Amsterdam, North-Holland publishing Company, 1973. Zbl0277.94039MR378498

1. Jean-François Perrot, Monoïdes syntactiques et familles de langages rationnels