{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:12Z","timestamp":1761611172455,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642305"},{"type":"electronic","value":"9783540697053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028571","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:33:39Z","timestamp":1132644819000},"page":"320-331","source":"Crossref","is-referenced-by-count":22,"title":["Relating hierarchies of word and tree automata"],"prefix":"10.1007","author":[{"given":"Damian","family":"Niwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of \u03bc-calculus. In CAV'93, volume 697 of LNCS, pages 385\u2013396, 1993.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In 29th FOGS, 1988.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOGS 91, 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"D. Janin and I. Walukiewicz. Automata for the \u03bc-calculus and related results. In MFCS '95, volume 969 of LNCS, pages 552\u2013562, 1995.","DOI":"10.1007\/3-540-60246-1_160"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"S. Krishnan, A. Puri, and R. Brayton. Structural complexity of \u03c9-automata. In STACS'95, volume 900 of LNCS, 1995.","DOI":"10.1007\/3-540-59042-0_69"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In 11th IEEE Symp. on Logic in Comput. Sci., pages 322\u2013332, 1996.","DOI":"10.1109\/LICS.1996.561360"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In A. Skowron, editor, Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157\u2013168, 1984.","DOI":"10.1007\/3-540-16066-3_15"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A. W. Mostowski","year":"1991","unstructured":"A. W. Mostowski. Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science, 83:323\u2013335, 1991.","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"D. Niwi\u0144ski. On fixed-point clones. In Proc. 13th ICALP, volume 226 of LNCS, pages 464\u2013473, 1986.","DOI":"10.1007\/3-540-16761-7_96"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"D. Niwifiski. Fixed points vs. infinite generation. In LICS '88, pages 402\u2013409, 1988.","DOI":"10.1109\/LICS.1988.5137"},{"key":"29_CR11","unstructured":"D. Niwi\u0144ski. Fixed point characterization of infinite behaviour of finite state systems. Theoretical Computer Science, 1998. to appear."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M. Rabin. Weakly definable relations and special automata. In Y.Bar-Hillel, editor, Mathematical Logic in Foundations of Set Theory, pages 1\u201323. 1970.","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol.B, pages 133\u2013192. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"29_CR15","first-page":"473","volume":"13","author":"K. Wagner","year":"1977","unstructured":"K. Wagner. Eine topologische Charakterisierung einiger Klassen reguldrer Folgenmengen. J. Inf. Process. Cybern. EIK, 13:473\u2013487, 1977.","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"K. Wagner. On \u03c9-regular sets. Information and Control, 43:123\u2013177, 1979.","journal-title":"Information and Control"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/inco.1996.0082","volume":"130","author":"T. Wilke","year":"1996","unstructured":"T. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Information and Computation, 130(1):61\u201370, 1996.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T20:06:37Z","timestamp":1736107597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0028571","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}