{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:10:28Z","timestamp":1767237028252},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00618-7","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:52:06Z","timestamp":1048611126000},"page":"37-81","source":"Crossref","is-referenced-by-count":38,"title":["Unambiguous B\u00fcchi automata"],"prefix":"10.1016","volume":"297","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]},{"given":"Max","family":"Michel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00618-7_BIB1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(83)90086-5","article-title":"Rational omega-languages are non-ambiguous","volume":"26","author":"Arnold","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00618-7_BIB2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(85)90071-7","article-title":"Codeterministic automata on infinite words","volume":"20","author":"Beauquier","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00618-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-4049(84)90055-0","article-title":"Iteration of expansions\u2014unambiguous expansions","volume":"34","author":"Birget","year":"1984","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB4","series-title":"Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science, Berkeley, 1960","first-page":"1","article-title":"On a decision method in the restricted second-order arithmetic","author":"B\u00fcchi","year":"1962"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","key":"10.1016\/S0304-3975(02)00618-7_BIB5"},{"year":"1995","series-title":"Fundamentals of Semigroup Theory","author":"Howie","key":"10.1016\/S0304-3975(02)00618-7_BIB6"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB7","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(02)00618-7_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. Control"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB9","unstructured":"M. Michel, Complementation is more difficult with automata on infinite words, Manuscript, 1988."},{"issue":"4","key":"10.1016\/S0304-3975(02)00618-7_BIB10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(82)90097-7","article-title":"Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indices","volume":"15","author":"Mostowski","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00618-7_BIB11","first-page":"157","article-title":"Regular expressions for infinite trees and a standard form for automata","volume":"vol. 208","author":"Mostowski","year":"1984"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB12","doi-asserted-by":"crossref","unstructured":"D. Muller, Infinite sequences and finite machines, in: Proc. 4th Annu. IEEE Symp. on Switching Theory and Logical Design, 1963, pp. 3\u201316.","DOI":"10.1109\/SWCT.1963.8"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB13","article-title":"Finite automata","volume":"vol. B","author":"Perrin","year":"1990"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB14","series-title":"NATO Advanced Study Institute Semigroups, Formal Languages and Groups","first-page":"49","article-title":"Semigroups and automata on infinite words","author":"Perrin","year":"1995"},{"year":"1986","series-title":"Varieties of Formal Languages","author":"Pin","key":"10.1016\/S0304-3975(02)00618-7_BIB15"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB16","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\/S0304-3975(02)00618-7_BIB17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata and applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00618-7_BIB18","article-title":"Automata on infinite objects","volume":"vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-4049(74)90046-2","article-title":"On the complexity of finite semigroups","volume":"5","author":"Tilson","year":"1974","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(02)00618-7_BIB20","first-page":"238","article-title":"An automata-theoretic approach to linear temporal logic","volume":"vol. 1043","author":"Vardi","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:50:04Z","timestamp":1553907004000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006187"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00618-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}