{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:12:20Z","timestamp":1648894340906},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"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":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90158-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"165-177","source":"Crossref","is-referenced-by-count":0,"title":["Generalized automata on infinite trees and Muller-McNaughton's Theorem"],"prefix":"10.1016","volume":"84","author":[{"given":"A.","family":"Saoudi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90158-X_BIB1","first-page":"445","article-title":"The metric space of infinite trees: algebraic and topological properties","volume":"4","author":"Arnold","year":"1980","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(91)90158-X_BIB2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0017316","article-title":"Centers of languages","volume":"104","author":"Boasson","year":"1981","journal-title":"Proc. 5th G.I., Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(91)90158-X_BIB3","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1960","journal-title":"Proc. Cong. Logic Method and Philosophy of Science"},{"key":"10.1016\/0304-3975(91)90158-X_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamentals of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90158-X_BIB5","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree acceptors and some of their applications","volume":"4","author":"Doner","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90158-X_BIB6","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up and top-down tree transformations: A comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90158-X_BIB7","first-page":"95","article-title":"Tree transducers, L-system and two-way machines","volume":"20","author":"Engelfriet","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90158-X_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01744582","article-title":"On push-down tree automata","volume":"16","author":"Guessarian","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90158-X_BIB9","first-page":"237","article-title":"Trees, automata, and games","author":"Gurevich","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90158-X_BIB10","series-title":"PhD. Dissertation at Lehrstuhl f\u00fcr Informatik II","article-title":"Automaten auf unendlichen B\u00e4umen","author":"Hafer","year":"1984"},{"key":"10.1016\/0304-3975(91)90158-X_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(83)80021-7","article-title":"Tree automata and attribute grammars","volume":"57","author":"Kamimura","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90158-X_BIB12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(82)90097-7","article-title":"Determinancy of sinking automata in infinite trees and inequalities between Rabin's pair indices","volume":"15","author":"Mostowski","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90158-X_BIB13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/SWCT.1963.8","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963","journal-title":"Proc. 4th IEEE on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0304-3975(91)90158-X_BIB14","first-page":"275","article-title":"Alternating automata, the weak monadic theory and its complexity","volume":"226","author":"Muller","year":"1986"},{"key":"10.1016\/0304-3975(91)90158-X_BIB15","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(91)90158-X_BIB16","article-title":"Rational, recognizable and computable languages","volume":"7","author":"Nivat","year":"1985"},{"key":"10.1016\/0304-3975(91)90158-X_BIB17","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(91)90158-X_BIB18","series-title":"Math. Logic and Foundation 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(91)90158-X_BIB19","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(84)90068-1","article-title":"Infinite tree languages recognized by \u03c9-automata","volume":"18","author":"Saoudi","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90158-X_BIB20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with applications to a decision problem of second order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(91)90158-X_BIB21","first-page":"335","article-title":"A hierarchy of sets of infinite trees","volume":"145","author":"Thomas","year":"1982"},{"key":"10.1016\/0304-3975(91)90158-X_BIB22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0019-9958(81)90663-X","article-title":"A combinatorial approach to the theory of \u03c9-automata","volume":"48","author":"Thomas","year":"1981","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190158X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190158X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:51Z","timestamp":1555077411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190158X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["030439759190158X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90158-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}