{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:22:30Z","timestamp":1762298550370},"reference-count":27,"publisher":"EDP Sciences","issue":"R2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["R.A.I.R.O. Informatique th\u00e9orique"],"published-print":{"date-parts":[[1976]]},"DOI":"10.1051\/ita\/197610r200331","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:29:40Z","timestamp":1486394980000},"page":"33-49","source":"Crossref","is-referenced-by-count":19,"title":["Hierarchies of aperiodic languages"],"prefix":"10.1051","volume":"10","author":[{"given":"Janusz A.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BIERMAN E., Realization of Star-Free Events, M.A.Sc. Thesis, Department of Electrical Engineering, University of Waterloo, Waterloo, Ont., Canada, 1971."},{"key":"R2","unstructured":"2. BRZOZOWSKI J. A., 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).1757190116.33605"},{"key":"R3","unstructured":"3. BRZOZOWSKI J. A., Run Languages, Bericht Nr. 87, Institut f\u00fbr Rechner-und Programstrukturen, Gesellschaft fur Mathematik und Datenverarbeitung mbH, Bonn, Germany, July 1975, 17 pp.431799"},{"key":"R4","unstructured":"4. BRZOZOWSKI J. A., On aperiodic I-monoids, Research Report CS-75-28, Computer Science Department, University of Waterloo, Waterloo, Ont., Canada, November 1975, 18 pp."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. BRZOZOWSKI J. A., CULIK II K., and GABRIELIAN A., Classification of Noncounting Events, J. Computer and System Sc, Vol. 5, 1971, pp. 41-53.2865780241.94050","DOI":"10.1016\/S0022-0000(71)80006-5"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BRZOZOWSKI J. A. and SIMON I., Characterizations of Locally Testable Events, Discrete Mathematics, Vol. 4, 1973, pp. 243-271.3194040255.94032","DOI":"10.1016\/S0012-365X(73)80005-6"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. CHOMSKY N. and SCH\u00dcTZENBERGER M. P., 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.1523910148.00804","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. COHEN R. S. and BRZOZOWSKI J. A., Dot-Depth of Star-Free Events, J. Computer & System Sc., Vol. 5, 1971, pp. 1-16.3096760217.29602","DOI":"10.1016\/S0022-0000(71)80003-X"},{"key":"R9","unstructured":"9. EILENBERG S., Automata, Languages, and Machines, Vol. A, New York, Academic Press, 1974 (Pure and Applied Mathematics Series, 59).5303820317.94045"},{"key":"R10","unstructured":"10. EILENBERG S., Automata, Languages and Machines, Vol. B, New York, Academic Press, 1976.5303830359.94067"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. GINZBURG A., About Some Properties of Definite, Reverse Definite and Related Automata, I.E.E.E. Trans. Electronic Computers EC-15, 1966, pp. 806-810.0156.01904","DOI":"10.1109\/PGEC.1966.264264"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. KLEENE S. C., 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).77478","DOI":"10.1515\/9781400882618-002"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. MCNAUGHTON R., Algebraic Decision Procedures for Local Testavility, Math. Systems Theory, Vol. 8, 1974, pp. 60-76.3925440287.02022","DOI":"10.1007\/BF01761708"},{"key":"R14","unstructured":"14. MCNAUGHTON R. and PAPERT S., Counter-Free Automata, Cambridge, The M.I.T. Press, 1971, (MIT Research Monographs, 65).3715380232.94024"},{"key":"R15","unstructured":"15. MEDVEDEV Yu. T., 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.0199.04202"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. MEYER A. R., A Note on Star-Free Events, J. Assoc. Comp. Machin., Vol. 16, 1969, pp. 220-225.2386240224.94060","DOI":"10.1145\/321510.321513"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. PERLES M., RABIN O. and SHAMIR E., The Theory of Definite Automata, I.E.E.E. Trans. Electronic Computers EC-12, 1963, pp. 233-143.1535180158.01002","DOI":"10.1109\/PGEC.1963.263534"},{"key":"R18","unstructured":"18. PERRIN D., Sur certains semigroupes syntaxiques, S\u00e9minaires de l'I.R.I.A. Logiques et Automates, 1971, pp. 169-177.0266.20066"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. SCH\u00dcTZENBERGER M. P., On Finite Monoids Having Only Trivial Sub-groups, Inform. and Control, Vol. 8, 1965, pp. 190-194.1768830131.02001","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"R20","unstructured":"20. SCH\u00dcTZENBERGER M. P., 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.2193650192.07902"},{"key":"R21","unstructured":"21. SCH\u00dcTZENBERGER M. P., Sur le produit de concat\u00e9nationnon ambigu, (to appear in Semigroup Forum).1341964448240373.20059"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"22. STEINBY M., On Definite Automata and Related Systems, Ann. Acad. Scient. Fennicae, series A.I., 1969, No. 444, 57 pp.2585410253.94030","DOI":"10.5186\/aasfm.1969.444"},{"key":"R23","unstructured":"23. SIMON I., Hierarchies of Events With Dot-Depth One, Ph. D. Thesis, Dept. of Applied Analysis & Computer Science, University of Waterloo, Waterloo, Ont., Canada, 1972.2623305"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. SIMON I., 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).4274980316.68034","DOI":"10.1007\/3-540-07407-4_23"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"25. ZALCSTEIN Y., Locally Testable Languages, J. Computer and System Sc., Vol. 6, 1972, pp. 151-167.3075380242.68038","DOI":"10.1016\/S0022-0000(72)80020-5"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"26. ZALCSTEIN Y., Locally Testable Semigroups, Semigroup Forum, Vol. 5, 1973, pp. 216-227.1339403201940273.20049","DOI":"10.1007\/BF02572893"},{"key":"R27","unstructured":"27. ZALCESTEIN Y., 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.3784980277.94039"}],"container-title":["Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R200331\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T16:33:30Z","timestamp":1658594010000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197610R200331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":27,"journal-issue":{"issue":"R2"},"alternative-id":["ita197610R200331"],"URL":"https:\/\/doi.org\/10.1051\/ita\/197610r200331","relation":{},"ISSN":["0397-9326"],"issn-type":[{"value":"0397-9326","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}