{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:10:37Z","timestamp":1773234637943,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642220111","type":"print"},{"value":"9783642220128","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_16","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T07:29:39Z","timestamp":1308382179000},"page":"210-221","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphism of Regular Trees and Words"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]},{"given":"Christian","family":"Mathissen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"London Mathematical Society Lecture Notes Series","volume-title":"Finite and Algorithmic Model Theory","author":"V. B\u00e1r\u00e1ny","year":"2011","unstructured":"B\u00e1r\u00e1ny, V., Gr\u00e4del, E., Rubin, S.: Automata-based presentations of infinite structures. In: Finite and Algorithmic Model Theory. London Mathematical Society Lecture Notes Series, vol.\u00a0379. Cambridge University Press, Cambridge (to appear, 2011)"},{"issue":"1-2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ic.2005.01.004","volume":"197","author":"S.L. Bloom","year":"2005","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational theory of regular words. Inf.\u00a0Comput.\u00a0197(1-2), 55\u201389 (2005)","journal-title":"Inf.\u00a0Comput."},{"key":"16_CR3","unstructured":"Bloom, S.L., \u00c9sik, Z.: Algebraic linear orderings. Technical report, arXiv.org (2010), http:\/\/arxiv.org\/abs\/1002.1624"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"issue":"1","key":"16_CR5","first-page":"114","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J.\u00a0ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J.\u00a0ACM"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Frontiers of infinite trees. ITA\u00a012(4) (1978)","DOI":"10.1051\/ita\/1978120403191"},{"key":"16_CR7","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)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z.: Representing small ordinals by finite automata. In: Proc. DCFS 2010. EPTCS, vol.\u00a031, pp. 78\u201387 (2010)","DOI":"10.4204\/EPTCS.31.10"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ipl.2010.10.018","volume":"111","author":"Z. \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z.: An undecidable property of context-free linear orders. Inf. Process. Lett.\u00a0111(3), 107\u2013109 (2011)","journal-title":"Inf. Process. Lett."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-48340-3_5","volume-title":"Mathematical Foundations of Computer Science 1999","author":"L. Gasieniec","year":"1999","unstructured":"Gasieniec, L., Gibbons, A., Rytter, W.: Efficiency of fast parallel pattern searching in highly compressed texts. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 48\u201358. Springer, Heidelberg (1999)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"L.M. Goldschlager","year":"1977","unstructured":"Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. SIGACT News\u00a09(2), 25\u201399 (1977)","journal-title":"SIGACT News"},{"issue":"2","key":"16_CR12","first-page":"131","volume":"14","author":"S. Heilbrunner","year":"1980","unstructured":"Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. ITA\u00a014(2), 131\u2013141 (1980)","journal-title":"ITA"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0022-0000(03)00042-4","volume":"66","author":"B. Jenner","year":"2003","unstructured":"Jenner, B., K\u00f6bler, J., McKenzie, P., Tor\u00e1n, J.: Completeness results for graph isomorphism. J. Comput. Syst. Sci.\u00a066(3), 549\u2013566 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput.\u00a086(1) (1990)","DOI":"10.1016\/0890-5401(90)90025-D"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.2168\/LMCS-3(2:2)2007","volume":"3","author":"B. Khoussainov","year":"2007","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Logical Methods in Computer Science\u00a03(2), 18(electronic) (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures with transitive relations. submitted for publication, extended version of a paper presented at LICS 2010 (2011)","DOI":"10.1109\/LICS.2010.10"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-73437-6_24","volume-title":"Combinatorial Pattern Matching","author":"Y. Lifshits","year":"2007","unstructured":"Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 228\u2013240. Springer, Heidelberg (2007)"},{"key":"16_CR18","unstructured":"Lohrey, M., Mathissen, C.: Isomorphism of regular trees and words. Technical report, arXiv.org (2011), http:\/\/arxiv.org\/abs\/1102.2782"},{"key":"16_CR19","first-page":"400","volume-title":"Proc.\u00a0STOC 1992","author":"S. Lindell","year":"1992","unstructured":"Lindell, S.: A logspace algorithm for tree canonization (extended abstract). In: Proc.\u00a0STOC 1992, pp. 400\u2013404. ACM Press, New York (1992)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"16_CR21","volume-title":"Linear Ordering","author":"J. Rosenstein","year":"1982","unstructured":"Rosenstein, J.: Linear Ordering. Academic Press, London (1982)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-27836-8_5","volume-title":"Automata, Languages and Programming","author":"W. Rytter","year":"2004","unstructured":"Rytter, W.: Grammar compression, LZ-encodings, and string algorithms with implicit input. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 15\u201327. Springer, Heidelberg (2004)"},{"key":"16_CR23","first-page":"1","volume-title":"Proc. STOCS 1973","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proc. STOCS 1973, pp. 1\u20139. ACM Press, New York (1973)"},{"issue":"4","key":"16_CR24","first-page":"371","volume":"20","author":"W. Thomas","year":"1986","unstructured":"Thomas, W.: On frontiers of regular trees. ITA\u00a020(4), 371\u2013381 (1986)","journal-title":"ITA"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T20:40:53Z","timestamp":1637872853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}