{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:59:22Z","timestamp":1779361162475,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,8,1]],"date-time":"1978-08-01T00:00:00Z","timestamp":270777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12769,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1978,8]]},"DOI":"10.1016\/0022-0000(78)90036-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"81-97","source":"Crossref","is-referenced-by-count":46,"title":["Finite automata, definable sets, and regular expressions over \u03c9n-tapes"],"prefix":"10.1016","volume":"17","author":[{"given":"Yaacov","family":"Choueka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90036-3_BIB1","series-title":"Proceedings of the International Congress on Logic, Methodology and Philosophy of Sciences 1960","article-title":"On a decision method in restricted second-order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0022-0000(78)90036-3_BIB2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1090\/S0002-9904-1965-11384-2","article-title":"Decision methods in the theory Of ordinals","volume":"71","author":"B\u00fcchi","year":"1965","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(78)90036-3_BIB3","article-title":"The monadic Second-Order Theory of All Countable Ordinals","author":"Buchi","year":"1973"},{"key":"10.1016\/0022-0000(78)90036-3_BIB4","article-title":"Finite Automata on Infinite Structures","author":"Choueka","year":"1970"},{"key":"10.1016\/0022-0000(78)90036-3_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories of automata on to-tapes: A simplified approach","volume":"8","author":"Choueka","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(78)90036-3_BIB6_1","article-title":"Theory of \u03c9-languages","author":"Coven","year":"1975","journal-title":"TR 44"},{"key":"10.1016\/0022-0000(78)90036-3_BIB6_2","article-title":"Theory of \u03c9-languages","author":"Coven","year":"1975","journal-title":"TR 47"},{"key":"10.1016\/0022-0000(78)90036-3_BIB6_3","article-title":"Theory of \u03c9-languages","author":"Coven","year":"1975"},{"key":"10.1016\/0022-0000(78)90036-3_BIB7","article-title":"\u03c9-computations on Turing machines","author":"Coven","year":"1976"},{"key":"10.1016\/0022-0000(78)90036-3_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2269808","article-title":"Decidability and undecidability of extensions of second (first) order theories of (generalized) successor","volume":"31","author":"Elgot","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(78)90036-3_BIB9","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0019-9958(76)90415-0","article-title":"On \u03c9-sets associated with context-free languages","volume":"31","author":"Linna","year":"1976","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90036-3_BIB10","series-title":"A Decidability Result for Deterministic \u03c9-Context-Free Languages","author":"Linna","year":"1976"},{"key":"10.1016\/0022-0000(78)90036-3_BIB11","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. Contr."},{"key":"10.1016\/0022-0000(78)90036-3_BIB12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(78)90036-3_BIB13","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(78)90036-3_BIB14","series-title":"Automatic theories and formale Sprachen, Bericht tagung Oberwolfach Okt. 1969","first-page":"441","article-title":"Decidable extensions of monadic second-order successor arithmetic","author":"Siefkes","year":"1970"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:28:17Z","timestamp":1550323697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,8]]}},"alternative-id":["0022000078900363"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90036-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,8]]}}}