{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:11:11Z","timestamp":1773234671151,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152047","type":"print"},{"value":"9783642152054","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15205-4_31","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T14:48:24Z","timestamp":1281710904000},"page":"396-410","source":"Crossref","is-referenced-by-count":1,"title":["The Isomorphism Problem for \u03c9-Automatic Trees"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems\u00a037(6), 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2178\/bsl\/1146620059","volume":"12","author":"W. Calvert","year":"2006","unstructured":"Calvert, W., Knight, J.F.: Classification from a computable viewpoint. Bulletin of Symbolic Logic\u00a012(2), 191\u2013218 (2006)","journal-title":"Bulletin of Symbolic Logic"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Choueka, Y.: Theories of automata on \u03c9-tapes: a simplified approach. Journal of Computer and System Sciences\u00a08, 117\u2013141 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0035762","volume-title":"Automata, Languages and Programming","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: The definability of equational graphs in monadic second-order logic. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 207\u2013221. Springer, Heidelberg (1989)"},{"issue":"2","key":"31_CR6","first-page":"339","volume":"43","author":"O. Finkel","year":"2009","unstructured":"Finkel, O.: Highly undecidable problems for infinite computations. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications\u00a043(2), 339\u2013364 (2009)","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2478\/s11533-010-0014-7","volume":"8","author":"O. Finkel","year":"2010","unstructured":"Finkel, O., Todor\u010devi\u0107, S.: The isomorphism relation between tree-autoamtic structures. Central European Journal of Mathematics\u00a08(2), 299\u2013313 (2010)","journal-title":"Central European Journal of Mathematics"},{"issue":"6","key":"31_CR8","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1023\/A:1021758312697","volume":"41","author":"S.S. Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and antistructure theorems. Algebra Logika\u00a041(6), 639\u2013681 (2002)","journal-title":"Algebra Logika"},{"key":"31_CR9","first-page":"431","volume-title":"Proc.\u00a0LICS 2008","author":"G. Hjorth","year":"2008","unstructured":"Hjorth, G., Khoussainov, B., Montalb\u00e1n, A., Nies, A.: From automatic structures to Borel structures. In: Proc.\u00a0LICS 2008, pp. 431\u2013441. IEEE Computer Society, Los Alamitos (2008)"},{"key":"31_CR10","first-page":"235","volume-title":"Proc.\u00a0LICS 2002","author":"H. Ishihara","year":"2002","unstructured":"Ishihara, H., Khoussainov, B., Rubin, S.: Some results on automatic structures. In: Proc.\u00a0LICS 2002, pp. 235\u2013244. IEEE Computer Society, Los Alamitos (2002)"},{"key":"31_CR11","unstructured":"Kaiser, L., Rubin, S., B\u00e1r\u00e1ny, V.: Cardinality and counting quantifiers on omega-automatic structures. In: Proc.\u00a0STACS 2008. LIPIcs, vol.\u00a01, pp. 385\u2013396. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"31_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A. Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Logical Methods in Computer Science\u00a03(2):2:2, 18 (electronic) (2007)","DOI":"10.2168\/LMCS-3(2:2)2007"},{"issue":"4","key":"31_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B. Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Transactions on Computational Logic\u00a06(4), 675\u2013700 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"31_CR16","unstructured":"Kuske, D.: Is Ramsey\u2019s theorem \u03c9-automatic? In: Proc.\u00a0STACS 2010. LIPIcs, vol.\u00a05, pp. 537\u2013548. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures. In: Proc. LICS 2010. IEEE Computer Society, Los Alamitos (2010) (accepted for publication)","DOI":"10.1109\/LICS.2010.10"},{"key":"31_CR18","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem for \u03c9-automatic trees, http:\/\/arxiv.org\/abs\/1004.0610"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.2178\/jsl\/1208358745","volume":"73","author":"D. Kuske","year":"2008","unstructured":"Kuske, D., Lohrey, M.: First-order and counting theories of omega-automatic structures. Journal of Symbolic Logic\u00a073, 129\u2013150 (2008)","journal-title":"Journal of Symbolic Logic"},{"key":"31_CR20","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y.V. Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"key":"31_CR21","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical recursion theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical recursion theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. North-Holland Publishing Co., Amsterdam (1989)"},{"key":"31_CR22","volume-title":"Pure and Applied Mathematics","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. In: Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"31_CR23","unstructured":"Rubin, S.: Automatic Structures. PhD thesis, University of Auckland (2004)"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2178\/bsl\/1208442827","volume":"14","author":"S. Rubin","year":"2008","unstructured":"Rubin, S.: Automata presenting structures: A survey of the finite string case. Bulletin of Symbolic Logic\u00a014, 169\u2013209 (2008)","journal-title":"Bulletin of Symbolic Logic"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.\u00a04, pp. 133\u2013191. Elsevier Science Publishers B. V., Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15205-4_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:32Z","timestamp":1606186952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15205-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152047","9783642152054"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15205-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}