{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:37:26Z","timestamp":1772249846025,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9055,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003126","name":"Opetus- ja Kulttuuriministeri\u00f6","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003126","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0304-3975(88)90105-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"25-32","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["On a subclass of \u221e-regular languages"],"prefix":"10.1016","volume":"61","author":[{"given":"Ivan","family":"Mezn\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90105-3_BIB1","series-title":"Proc. Internat. Congr. Logic, Method and Philos. Sci.","first-page":"1","article-title":"On a decision method in restricted second-order arithmetics","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(88)90105-3_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories on \u03c9-tapes: a simplified approach","volume":"8","author":"Choueka","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90105-3_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0022-0000(77)80005-6","article-title":"Theory of \u03c9-languages II: a study of various models of \u03c9-type generation and recognition","volume":"15","author":"Cohen","year":"1977","journal-title":"J. Comput. System Sci."},{"issue":"7","key":"10.1016\/0304-3975(88)90105-3_BIB4","first-page":"399","article-title":"The k-machines","volume":"Vol. XVIII","author":"Grodzki","year":"1970","journal-title":"Bull. Acad. Polon. Ser. Sci. Math. Astronom. Phys."},{"key":"10.1016\/0304-3975(88)90105-3_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(70)90452-3","article-title":"Generable sets","volume":"17","author":"Kwasoviec","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90105-3_BIB6","first-page":"1","article-title":"On \u03c9-words and \u03c9-computations","volume":"168","author":"Linna","year":"1975","journal-title":"Ann. Univ. Turku."},{"key":"10.1016\/0304-3975(88)90105-3_BIB7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating sequences by a finite automation","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90105-3_BIB8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0019-9958(72)90898-4","article-title":"G-machines and generable sets","volume":"5","author":"Mezn\u00edk","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90105-3_BIB9","first-page":"203","article-title":"On finite [k]-machines and their languages","volume":"B-56","author":"Mezn\u00edk","year":"1975","journal-title":"Kniz. Odb. aVed. Spisu VUT Brno"},{"key":"10.1016\/0304-3975(88)90105-3_BIB10","series-title":"Proc. MFCS-1975,","first-page":"320","article-title":"On some lattice-theoretic properties of generable languages","volume":"32","author":"Mezn\u00edk","year":"1975"},{"key":"10.1016\/0304-3975(88)90105-3_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/SWCT.1963.8","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963","journal-title":"IEEE Proc. Fourth Ann. Symp. on Switching Theory and Logical Design"},{"key":"10.1016\/0304-3975(88)90105-3_BIB12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ita\/1977110403111","article-title":"Mots infinis engendr\u00e9s par une grammaire alg\u00e9brique","volume":"11","author":"Nivat","year":"1977","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(88)90105-3_BIB13","series-title":"Foundations of Computer Science III","first-page":"5","article-title":"Infinite words, infinite trees, infinite computations","author":"Nivat","year":"1979"},{"key":"10.1016\/0304-3975(88)90105-3_BIB14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0019-9958(84)80049-2","article-title":"Fixed-point characterization of context-free \u221e-languages","volume":"61","author":"Niwinski","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90105-3_BIB15","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0019-9958(74)90418-5","article-title":"Sets constructed by acceptors","volume":"26","author":"Novotn\u00fd","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90105-3_BIB16","first-page":"7","article-title":"Stored program computers","volume":"10","author":"Pawlak","year":"1969","journal-title":"Algorytmy"},{"key":"10.1016\/0304-3975(88)90105-3_BIB17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problem","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(88)90105-3_BIB18","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"149","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90105-3_BIB19","series-title":"Computation and Automata","author":"Salomaa","year":"1985"},{"key":"10.1016\/0304-3975(88)90105-3_BIB20","first-page":"219","article-title":"Hierarchies of recursive \u03c9-languages","volume":"22","author":"Staiger","year":"1986","journal-title":"Elektron. Informationsverarb. Kybern."},{"key":"10.1016\/0304-3975(88)90105-3_BIB21","first-page":"185","article-title":"Reasoning about computation paths","author":"Wolper","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:14Z","timestamp":1757477894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0304397588901053"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90105-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On a subclass of \u221e-regular languages","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(88)90105-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}