{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:49Z","timestamp":1725663829043},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:09:02Z","timestamp":1330258142000},"page":"262-271","source":"Crossref","is-referenced-by-count":0,"title":["Rabin tree automata and finite monoids"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"18_CR1","unstructured":"John R. B\u00fcchi \u201cOn a decision method in restricted second order arithmetic\u201d. In Erich Nagel et al., editors, Logic, Methodology, and Philosophy of Science, pages 1\u201311. Stanford Univ. Press, 1960."},{"key":"18_CR2","unstructured":"Samuel Eilenberg. Automata, Language and Machine, volume B of Applied and Pure Mathematics. Academic Press, 1976."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Dexter Kozen and Jerzy Tiuryn. \u201cLogics of programs\u201d. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Sience, volume B, chapter 4, pages 789\u2013840. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50019-6"},{"key":"18_CR4","volume-title":"Resolution of Equations in Algebraic Structures, Vol. 1","author":"M. Nivat","year":"1989","unstructured":"Maurice Nivat and Andreas Podelski. \u201cTree Monoids and Recognizable Sets of Trees\u201d. In Hassan A\u00eft-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures, Vol. 1 (Academic Press, London, 1989)."},{"key":"18_CR5","unstructured":"Maurice Nivat and Andreas Podelski, editors. Tree Automata, Advances and Open Problems. Elsevier Science, 1992."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Jean-Pierre P\u00e9cuchet. \u201cEtude syntaxique des parties reconnaissables de mots infinis\u201d. In Laurent Kott, editor, Proc. 13th ICALP, LNCS 226, pages 294\u2013303, 1987.","DOI":"10.1007\/3-540-16761-7_79"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Pierre Peladeau and Andreas Podelski. \u201cOn Reverse and General Definite Tree Languages\u201d. In Proc. 18th ICALP, LNCS. 1992.","DOI":"10.1007\/3-540-55719-9_71"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Dominique Perrin. \u201cRecent results on automata and infinite words\u201d. In M.P. Chytil and V. Koubek, editors, Math. Found. of Comp. Sci., LNCS 176, pages 134\u2013148.1984.","DOI":"10.1007\/BFb0030294"},{"key":"18_CR9","volume-title":"Vari\u00e9t\u00e9s de langages formels","author":"J. Pin","year":"1984","unstructured":"Jean-Eric Pin, Vari\u00e9t\u00e9s de langages formels, Masson, Paris, 1984, and Varieties of Formal Langages, Plenum, London, 1986."},{"key":"18_CR10","first-page":"1","volume":"141","author":"Michael O. O. Rabin","year":"1969","unstructured":"Michael O. Rabin. \u201cDecidability of second-order theories and automata on infinite trees\u201d. Trans. Amer. Math. Soc. 141, pages 1\u201335.1969.","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Michael O. Rabin. \u201cDecidable theories\u201d. In John Barwise, editor, Handbook of Mathematical Logic, pages 595\u2013630. North-Holland, 1977.","DOI":"10.1016\/S0049-237X(08)71116-9"},{"key":"18_CR12","unstructured":"Magnus Steinby, \u201cA Theory of Tree Language Varieties\u201d. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992."},{"key":"18_CR13","first-page":"31","volume-title":"Logical aspects in the study of tree languages","author":"W. Thomas","year":"1984","unstructured":"Wolfgang Thomas. \u201cLogical aspects in the study of tree languages\u201d, In Bruno Courcelle, editor, Proc. Ninth Coll. Trees in Algebra and in Programming, pages 31\u201349. Cambridge Univers. Press, Cambridge, 1984."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. \u201cAutomata on infinite objects\u201d. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Sience, volume B, chapter 4, pages 133\u2013161. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:35Z","timestamp":1605647315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}