{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:45:07Z","timestamp":1648781107007},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":7837,"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":[[1992,2]]},"DOI":"10.1016\/0304-3975(92)90331-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"227-244","source":"Crossref","is-referenced-by-count":0,"title":["On automata on infinite trees"],"prefix":"10.1016","volume":"93","author":[{"given":"P.","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"G.","family":"Mauri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90331-9_BIB1","series-title":"Proc. 1960 Internat. Conf. on Logic, Methodology and Philosophy of Science","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(92)90331-9_BIB2","first-page":"266","article-title":"Infinitary languages: basic theory and applications to concurrent systems","volume":"Vol. 224","author":"Hoogeboom","year":"1986"},{"key":"10.1016\/0304-3975(92)90331-9_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 automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90331-9_BIB4","first-page":"275","article-title":"Alternating automata, the weak monadic theory of the tree, and its complexity","volume":"Vol. 226","author":"Muller","year":"1986"},{"key":"10.1016\/0304-3975(92)90331-9_BIB5","series-title":"Automata on Infinite Words","volume":"Vol. 192","year":"1985"},{"key":"10.1016\/0304-3975(92)90331-9_BIB6","first-page":"131","article-title":"Automata on infinite trees and Kleene closure of regular trees set","volume":"36","author":"Nivat","year":"1988","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0304-3975(92)90331-9_BIB7","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\/0304-3975(92)90331-9_BIB8","series-title":"Mathematical Logic and Foundations of Set Theory","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)71929-3","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1970"},{"key":"10.1016\/0304-3975(92)90331-9_BIB9","unstructured":"A. Saodui, Generalized automata on infinite trees and Muller-McNaughton's theorem. Report L.I.T.P. 88-6, Univ. Paris VII."},{"key":"10.1016\/0304-3975(92)90331-9_BIB10","first-page":"465","article-title":"The Complementation Problem for B\u00fcchi Automata with Applications to Temporal Logic","volume":"Vol. 194","author":"Sistla","year":"1985"},{"key":"10.1016\/0304-3975(92)90331-9_BIB11","series-title":"Aachener Infomatik-Berichte Nr. 88-17","article-title":"Automata on infinite objects","author":"Thomas","year":"1988"},{"key":"10.1016\/0304-3975(92)90331-9_BIB12","first-page":"167","article-title":"Verification of concurrent programs: the automata-theoretic framework","author":"Vardi","year":"1987","journal-title":"Proc. of IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90331-9_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","article-title":"Automata-Theoretic Techniques for Modal Logics of Programs","volume":"32","author":"Vardi","year":"1986","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903319?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:57:04Z","timestamp":1555127824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592903319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0304397592903319"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90331-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}