Hierarchies of aperiodic languages

Janusz A. Brzozowski

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1976)

  • Volume: 10, Issue: R2, page 33-49
  • ISSN: 0988-3754

How to cite

top

Brzozowski, Janusz A.. "Hierarchies of aperiodic languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 10.R2 (1976): 33-49. <http://eudml.org/doc/92031>.

@article{Brzozowski1976,
author = {Brzozowski, Janusz A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {R2},
pages = {33-49},
publisher = {EDP-Sciences},
title = {Hierarchies of aperiodic languages},
url = {http://eudml.org/doc/92031},
volume = {10},
year = {1976},
}

TY - JOUR
AU - Brzozowski, Janusz A.
TI - Hierarchies of aperiodic languages
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1976
PB - EDP-Sciences
VL - 10
IS - R2
SP - 33
EP - 49
LA - eng
UR - http://eudml.org/doc/92031
ER -

References

top
  1. 1. E. BIERMAN, Realization of Star-Free Events, M.A.Sc. Thesis, Department of Electrical Engineering, University of Waterloo, Waterloo, Ont., Canada, 1971. 
  2. 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). Zbl0116.33605MR175719
  3. 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. MR431799
  4. 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. 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. Zbl0241.94050MR286578
  6. 6. J. A. BRZOZOWSKI and I. SIMON, Characterizations of Locally Testable Events, Discrete Mathematics, Vol. 4, 1973, pp. 243-271. Zbl0255.94032MR319404
  7. 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. Zbl0148.00804MR152391
  8. 8. R. S. COHEN and J. A. BRZOZOWSKI, Dot-Depth of Star-Free Events, J. Computer & System Sc., Vol. 5, 1971, pp. 1-16. Zbl0217.29602MR309676
  9. 9. S. EILENBERG, Automata, Languages, and Machines, Vol. A, New York, Academic Press, 1974 (Pure and Applied Mathematics Series, 59). Zbl0317.94045MR530382
  10. 10. S. EILENBERG, Automata, Languages and Machines, Vol. B, New York, Academic Press, 1976. Zbl0359.94067MR530383
  11. 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. Zbl0156.01904
  12. 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). MR77478
  13. 13. R. MCNAUGHTON, Algebraic Decision Procedures for Local Testavility, Math. Systems Theory, Vol. 8, 1974, pp. 60-76. Zbl0287.02022MR392544
  14. 14. R. MCNAUGHTON and S. PAPERT, Counter-Free Automata, Cambridge, The M.I.T. Press, 1971, (MIT Research Monographs, 65). Zbl0232.94024MR371538
  15. 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. Zbl0199.04202
  16. 16. A. R. MEYER, A Note on Star-Free Events, J. Assoc. Comp. Machin., Vol. 16, 1969, pp. 220-225. Zbl0224.94060MR238624
  17. 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. Zbl0158.01002MR153518
  18. 18. D. PERRIN, Sur certains semigroupes syntaxiques, Séminaires de l'I.R.I.A. Logiques et Automates, 1971, pp. 169-177. Zbl0266.20066
  19. 19. M. P. SCHÜTZENBERGER, On Finite Monoids Having Only Trivial Sub-groups, Inform. and Control, Vol. 8, 1965, pp. 190-194. Zbl0131.02001MR176883
  20. 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. Zbl0192.07902MR219365
  21. 21. M. P. SCHÜTZENBERGER, Sur le produit de concaténationnon ambigu, (to appear in Semigroup Forum). Zbl0373.20059MR444824
  22. 22. M. STEINBY, On Definite Automata and Related Systems, Ann. Acad. Scient. Fennicae, series A.I., 1969, No. 444, 57 pp. Zbl0253.94030MR258541
  23. 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. MR2623305
  24. 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). Zbl0316.68034MR427498
  25. 25. Y. ZALCSTEIN, Locally Testable Languages, J. Computer and System Sc., Vol. 6, 1972, pp. 151-167. Zbl0242.68038MR307538
  26. 26. Y. ZALCSTEIN, Locally Testable Semigroups, Semigroup Forum, Vol. 5, 1973, pp. 216-227. Zbl0273.20049MR320194
  27. 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. Zbl0277.94039MR378498

Citations in EuDML Documents

top
  1. Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier, Efficiency of automata in semi-commutation verification techniques
  2. J. A. Brzozowski, Robert Knast, Graph congruences and pair testing
  3. Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier, Efficiency of automata in semi-commutation verification techniques
  4. Robert Knast, A semigroup characterization of dot-depth one languages
  5. Jean-Eric Pin, Hiérarchies de concaténation
  6. Jorge Almeida, Ana P. Escada, The globals of pseudovarieties of ordered semigroups containing and an application to a problem proposed by Pin
  7. Alex Weiss, Denis Therien, Varieties of finite categories
  8. Jorge Almeida, Ana P. Escada, The globals of pseudovarieties of ordered semigroups containing B 2 and an application to a problem proposed by Pin
  9. Jean-Eric Pin, Pascal Weil, A conjecture on the concatenation product
  10. Jean-Eric Pin, Pascal Weil, A conjecture on the concatenation product

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.