{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:57:20Z","timestamp":1649008640810},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0304-3975(96)00006-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"1-21","source":"Crossref","is-referenced-by-count":4,"title":["Finite acceptance of infinite words"],"prefix":"10.1016","volume":"174","author":[{"given":"Igor","family":"Litovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludwig","family":"Staiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00006-0_BIB1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherences of languages","volume":"20","author":"Boasson","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB2","series-title":"Proc. 1960 Congr. Logic, Method. and Philos. Sci.","first-page":"1","article-title":"On decision method in restricted second-order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(93)90349-X","article-title":"X-automata on \u03c9-words","volume":"110","author":"Engelfriet","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB4","series-title":"Fairness","author":"Francez","year":"1986"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB5","series-title":"Topology I","author":"Kuratowski","year":"1966"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB6","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB7","series-title":"Algebraische Codierungstheorie \u2014 Theorie der sequentiellen Codierungen","author":"Lindner","year":"1977"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB8","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. and Control"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(88)90121-1","article-title":"Accepting conditions for automata on \u03c9-languages","volume":"61","author":"Moriya","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB10","series-title":"Proc. 4th Ann. IEEE Symp. on Switching Theory and Logical Design","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB11","article-title":"Zur Topologie der regul\u00e4ren Mengen","author":"Staiger","year":"1976"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(84)90050-1","article-title":"Projection lemmas for \u03c9-languages","volume":"32","author":"Staiger","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"8\/9","key":"10.1016\/S0304-3975(96)00006-0_BIB13","first-page":"415","article-title":"Research in the theory of \u03c9-languages","volume":"EIK 23","author":"Staiger","year":"1987","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB14","series-title":"Proc. STACS '93","first-page":"629","article-title":"Recursive automata on infinite words","volume":"Vol. 665","author":"Staiger","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(96)00006-0_BIB15","first-page":"379","article-title":"Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen","volume":"EIK10","author":"Staiger","year":"1974","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(83)90057-9","article-title":"A note on \u03c9-regular languages","volume":"23","author":"Takahashi","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB17","first-page":"133","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB18_1","first-page":"103","article-title":"Finite automata and monadic second order logic","volume":"3","author":"Trakhtenbrot","year":"1962","journal-title":"Sibirsk. Mat. J."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB18_2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/trans2\/059\/02","volume":"59","author":"Trakhtenbrot","year":"1966","journal-title":"Amer. Math. Soc. Transl."},{"key":"10.1016\/S0304-3975(96)00006-0_BIB19","series-title":"Finite Automata, Behaviour and Synthesis","author":"Trakhtenbrot","year":"1970"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB20","article-title":"Zur Theorie der regul\u00e4ren Folgenmengen","author":"Wagner","year":"1976"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","article-title":"On \u03c9-regular sets","volume":"43","author":"Wagner","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB22","series-title":"Fundamentals of Computation Theory","first-page":"532","article-title":"Recursive \u03c9-languages","volume":"Vol. 56","author":"Wagner","year":"1977"},{"key":"10.1016\/S0304-3975(96)00006-0_BIB23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(89)90152-7","article-title":"Language-theoretical representations of \u03c9-languages","volume":"66","author":"Yamasaki","year":"1989","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:57:19Z","timestamp":1555419439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0304397596000060"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00006-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}