{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:25Z","timestamp":1776316885797,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425540","type":"print"},{"value":"9783540448020","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_38","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"539-553","source":"Crossref","is-referenced-by-count":19,"title":["Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Ohsaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"R.V. Book and F. Otto: String-Rewriting Systems, Texts and Monographs in Computer Science, Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"38_CR2","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi: Tree Automata Techniques and Applications, draft, 1997. Available on http:\/\/www.grappa.univ-lille3.fr\/tata\/ ."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison: The Theory of Ground Rewrite Systems is Decidable, Proc. 5th LICS, Philadelphia (Pennsylvania), pp. 242\u2013248, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"38_CR4","unstructured":"M. Dauchet and S. Tison: Structual Complexity of Classes of Tree Languages, In Tree Automata and Languages, Studies in Computer Science and Artificial Intelligence 10, pp. 327\u2013353, Elsevier Science Publishers B.V., 1992."},{"key":"38_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/3-540-50939-9_135","volume-title":"Proc. CAAP\u201989","author":"A. Deruyver","year":"1989","unstructured":"A. Deruyver and R. Gilleron: The Reachability Problem for Ground TRS and Some Extensions, Proc. CAAP\u201989, Barcelona (Spain), LNCS 351, pp. 227\u2013243, 1989."},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"I. Durand and A. Middeldorp: Decidable Call by Need Computations in Term Rewriting (Extended Abstract), Proc. 14th CADE, Townsville (Australia), LNAI 1249, pp. 4\u201318, 1997.","DOI":"10.1007\/3-540-63104-6_2"},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"R. Gilleron and S. Tison: Regular Tree Languages and Rewriting Systems, Fundamenta Informaticae 24, pp. 157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"38_CR8","unstructured":"J.E. Hopcroft and J.D. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, 1979."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"H. Hosoya, J. Vouillon and B.C. Pierce: Regular Expression Types for XML, Proc. 5th ICFP, Montreal (Canada), SIGPLAN Notices 35(9), pp. 11\u201322, 2000.","DOI":"10.1145\/351240.351242"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jsco.1996.0077","volume":"23","author":"Y. Kaji","year":"1997","unstructured":"Y. Kaji, T. Fujiwara and T. Kasami: Solving a Unification Problem under Constrained Substitutions Using Tree Automata, Journal of Symbolic Computation 23, pp. 79\u2013117, 1997.","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"38_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1006\/jsco.1994.1049","volume":"18","author":"D. Lugiez","year":"1994","unstructured":"D. Lugiez and J.L. Moysset: Tree Automata Help One to Solve Equational Formulae in AC-Theories, Journal of Symbolic Computation 18(4), pp. 297\u2013318, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"38_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Proc. 6th SAS","author":"D. Monniaux","year":"1999","unstructured":"D. Monniaux: Abstracting Cryptographic Protocols with Tree Automata, Proc. 6th SAS, Venice (Italy), LNCS 1694, pp. 149\u2013163, 1999."},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","volume":"13","author":"E.L. Post","year":"1947","unstructured":"E.L. Post: Recursive Unsolvability of a Problem of Thue, Journal of Symbolic Logic 13, pp. 1\u201311, 1947.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T16:24:46Z","timestamp":1587572686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}