{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:19:31Z","timestamp":1768267171997,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90024-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"91-99","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Characterization of \u03c9-regular languages by monadic second-order formulas"],"prefix":"10.1016","volume":"46","author":[{"given":"Hideki","family":"Yamasaki","sequence":"first","affiliation":[]},{"given":"Masako","family":"Takahashi","sequence":"additional","affiliation":[]},{"given":"Kojiro","family":"Kobayashi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90024-1_BIB1","series-title":"Internat. Congress on Logic, Methodology, and Philosophy","article-title":"On a decision method in restricted second-order arithmetic","author":"B\u00fcchi","year":"1960"},{"key":"10.1016\/0304-3975(86)90024-1_BIB2","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(86)90024-1_BIB3","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(86)90024-1_BIB4","first-page":"379","article-title":"Automatatheoretische und automatenfreie Characterisierungen topologischer Klassen regularer Folgenmengen","volume":"10","author":"Staiger","year":"1974","journal-title":"Elektron. Informationsverarb. Kybernetik"},{"key":"10.1016\/0304-3975(86)90024-1_BIB5","doi-asserted-by":"crossref","first-page":"214","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\/0304-3975(86)90024-1_BIB6","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(79)90629-6","article-title":"Star-free regular sets of \u03c9-sequences","volume":"42","author":"Thomas","year":"1979","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900241?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900241?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:46Z","timestamp":1553201626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":6,"alternative-id":["0304397586900241"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90024-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}