{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:03:47Z","timestamp":1768287827549,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(83)90027-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"315-327","source":"Crossref","is-referenced-by-count":7,"title":["Characterization of \u03c9-regular languages by first-order formulas"],"prefix":"10.1016","volume":"28","author":[{"given":"Kojiro","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Masako","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Yamasaki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90027-0_BIB1","series-title":"Automata, Languages, and Machines, Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(83)90027-0_BIB2","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\/0304-3975(83)90027-0_BIB3","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 automation","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(83)90027-0_BIB4","article-title":"Automata on Infinite Objects and Church's Problem","volume":"13","author":"Rabin","year":"1969"},{"key":"10.1016\/0304-3975(83)90027-0_BIB5","first-page":"379","article-title":"Automatentheoretische und automatenfreie Characterisierungen topologischer Klassen regularer Folgenmengen","volume":"10","author":"Staiger","year":"1974","journal-title":"Electron. Informationsverarb. Kybernet."},{"issue":"2","key":"10.1016\/0304-3975(83)90027-0_BIB6","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:20Z","timestamp":1555127420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900270"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90027-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}