Hierarchies of aperiodic languages
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Volume 10 (1976) no. R2, pp. 33-49.
@article{ITA_1976__10_2_33_0,
     author = {Brzozowski, Janusz A.},
     title = {Hierarchies of aperiodic languages},
     journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique},
     pages = {33--49},
     publisher = {Dunod-Gauthier-Villars},
     address = {Paris},
     volume = {10},
     number = {R2},
     year = {1976},
     mrnumber = {428813},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1976__10_2_33_0/}
}
TY  - JOUR
AU  - Brzozowski, Janusz A.
TI  - Hierarchies of aperiodic languages
JO  - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
PY  - 1976
SP  - 33
EP  - 49
VL  - 10
IS  - R2
PB  - Dunod-Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1976__10_2_33_0/
LA  - en
ID  - ITA_1976__10_2_33_0
ER  - 
%0 Journal Article
%A Brzozowski, Janusz A.
%T Hierarchies of aperiodic languages
%J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
%D 1976
%P 33-49
%V 10
%N R2
%I Dunod-Gauthier-Villars
%C Paris
%U http://www.numdam.org/item/ITA_1976__10_2_33_0/
%G en
%F ITA_1976__10_2_33_0
Brzozowski, Janusz A. Hierarchies of aperiodic languages. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Volume 10 (1976) no. R2, pp. 33-49. http://www.numdam.org/item/ITA_1976__10_2_33_0/

1. E. Bierman, Realization of Star-Free Events, M.A.Sc. Thesis, Department of Electrical Engineering, University of Waterloo, Waterloo, Ont., Canada, 1971.

2. J. A. Brzozowski, Canonical Regular Expressions and Minimal State Graphs for Definite Events, Mathematical Theory of Automata, New York, 1962, pp. 529-561, Brooklyn, Polytechnic Institute of Brooklyn, 1963 (Symposia Series, 12). | MR | Zbl

3. J. A. Brzozowski, Run Languages, Bericht Nr. 87, Institut fûr Rechner-und Programstrukturen, Gesellschaft fur Mathematik und Datenverarbeitung mbH, Bonn, Germany, July 1975, 17 pp. | MR

4. J. A. Brzozowski, On aperiodic I-monoids, Research Report CS-75-28, Computer Science Department, University of Waterloo, Waterloo, Ont., Canada, November 1975, 18 pp.

5. J. A. Brzozowski, K. Culik Ii, and A. Gabrielian, Classification of Noncounting Events, J. Computer and System Sc, Vol. 5, 1971, pp. 41-53. | MR | Zbl

6. J. A. Brzozowski and I. Simon, Characterizations of Locally Testable Events, Discrete Mathematics, Vol. 4, 1973, pp. 243-271. | MR | Zbl

7. N. Chomsky and M. P. Schützenberger, The Algebraic Theory of Context-Free Languages, Computer Programming and Formal Systems, edited by P. BRAFFORT and D. HIRSCHBERG, pp. 118-161, Amsterdam, North Holland Publishing Company, 1963. | MR | Zbl

8. R. S. Cohen and J. A. Brzozowski, Dot-Depth of Star-Free Events, J. Computer & System Sc., Vol. 5, 1971, pp. 1-16. | MR | Zbl

9. S. Eilenberg, Automata, Languages, and Machines, Vol. A, New York, Academic Press, 1974 (Pure and Applied Mathematics Series, 59). | MR | Zbl

10. S. Eilenberg, Automata, Languages and Machines, Vol. B, New York, Academic Press, 1976. | MR | Zbl

11. A. Ginzburg, About Some Properties of Definite, Reverse Definite and Related Automata, I.E.E.E. Trans. Electronic Computers EC-15, 1966, pp. 806-810. | Zbl

12. S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, edited by CE. SHANNON and J. MCCARTHY, pp. 3-41, Princeton, Princeton University Press, 1954, (Annals of Mathematics Studies, 34). | MR

13. R. Mcnaughton, Algebraic Decision Procedures for Local Testavility, Math. Systems Theory, Vol. 8, 1974, pp. 60-76. | MR | Zbl

14. R. Mcnaughton and S. Papert, Counter-Free Automata, Cambridge, The M.I.T. Press, 1971, (MIT Research Monographs, 65). | MR | Zbl

15. Yu. T. Medvedev, On the Class of Events Representable in a Finite Automaton (translated from Russian), Sequential Machines-Selected Papers, edited by E.F. MOORE, Reading, Mass., Addison-Wesley, 1964. | Zbl

16. A. R. Meyer, A Note on Star-Free Events, J. Assoc. Comp. Machin., Vol. 16, 1969, pp. 220-225. | MR | Zbl

17. M. Perles, O. Rabin and E. Shamir, The Theory of Definite Automata, I.E.E.E. Trans. Electronic Computers EC-12, 1963, pp. 233-143. | MR | Zbl

18. D. Perrin, Sur certains semigroupes syntaxiques, Séminaires de l'I.R.I.A. Logiques et Automates, 1971, pp. 169-177. | Zbl

19. M. P. Schützenberger, On Finite Monoids Having Only Trivial Sub-groups, Inform. and Control, Vol. 8, 1965, pp. 190-194. | MR | Zbl

20. M. P. Schützenberger, On a Family of Sets Related to McNaughton's L-Language, Automata Theory, edited by E.R. CAIANIELLO, pp. 320-324, New York, Academic Press, 1966. | MR | Zbl

21. M. P. Schützenberger, Sur le produit de concaténationnon ambigu, (to appear in Semigroup Forum). | MR | Zbl

22. M. Steinby, On Definite Automata and Related Systems, Ann. Acad. Scient. Fennicae, series A.I., 1969, No. 444, 57 pp. | MR | Zbl

23. I. Simon, Hierarchies of Events With Dot-Depth One, Ph. D. Thesis, Dept. of Applied Analysis & Computer Science, University of Waterloo, Waterloo, Ont., Canada, 1972. | MR

24. I. Simon, Piecewise Testable Events, 2nd GI-Professional Conference on Automata Theory and Formal Languages, Kaiserslautern, Germany, May 1975. (To appear in Lecture Notes in Computer Science, Springer-Verlag, Berlin). | MR | Zbl

25. Y. Zalcstein, Locally Testable Languages, J. Computer and System Sc., Vol. 6, 1972, pp. 151-167. | MR | Zbl

26. Y. Zalcstein, Locally Testable Semigroups, Semigroup Forum, Vol. 5, 1973, pp. 216-227. | MR | Zbl

27. Y. Zalcestein, Syntactic Semigroups of Some Classes of Star-Free Languages, Automata, Languages and Programming, Proceedings of a Symposium, Rocquencourt, 1972, pp. 135-144, Amsterdam, North-Holland Publishing Company, 1973. | MR | Zbl