{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:12:26Z","timestamp":1794348746685,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746201","type":"print"},{"value":"9783540746218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74621-8_15","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T07:46:32Z","timestamp":1187768792000},"page":"221-236","source":"Crossref","is-referenced-by-count":2,"title":["Languages Modulo Normalization"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Ohsaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","first-page":"235","volume-title":"Rewriting Techniques and Applications","author":"J. Carme","year":"2004","unstructured":"Carme, J., Niehren, J., Tommasi, M.: Querying Unranked Trees with Stepwise Tree Automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 235\u2013236. Springer, Heidelberg (2004)"},{"key":"15_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, draft (2005), available at \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"15_CR4","first-page":"123","volume-title":"Ground Reducibility is EXPTIME-Complete, Information and Computation","author":"H. Comon","year":"2003","unstructured":"Comon, H., Jacquemard, F.: Ground Reducibility is EXPTIME-Complete, Information and Computation, vol.\u00a0187(1), pp. 123\u2013153. Elsevier, Amsterdam (2003)"},{"key":"15_CR5","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: The CiME System: Version 2.02, Software and the document (2004), available at \n                    \n                      http:\/\/cime.lri.fr\/"},{"key":"15_CR6","first-page":"337","volume-title":"Applicable Algebra in Engineering, Communication and Computing","author":"S. Zilio Dal","year":"2006","unstructured":"Dal Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Applicable Algebra in Engineering, Communication and Computing, vol.\u00a017(5), pp. 337\u2013377. Springer, Heidelberg (2006)"},{"key":"15_CR7","first-page":"613","volume-title":"Acta Informatica","author":"J. Engelfriet","year":"2003","unstructured":"Engelfriet, J., Maneth, S.: A Comparison of Pebble Tree Transducers with Macro Tree Transducers. In: Acta Informatica, vol.\u00a039, pp. 613\u2013698. Springer, Heidelberg (2003)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10817-004-6246-0","volume":"33","author":"G. Feuillade","year":"2004","unstructured":"Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning\u00a033, 341\u2013383 (2004)","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/11814771_14","volume-title":"Automated Reasoning","author":"J. Hendrix","year":"2006","unstructured":"Hendrix, J., Meseguer, J., Ohsaki, H.: A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 151\u2013155. Springer, Heidelberg (2006)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11805618_5","volume-title":"Term Rewriting and Applications","author":"J. Hendrix","year":"2006","unstructured":"Hendrix, J., Ohsaki, H., Viswanathan, M.: Propositional Tree Automata. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 50\u201365. Springer, Heidelberg (2006)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/351240.351242","volume-title":"Proc. of 5th ICFP","author":"H. Hosoya","year":"2000","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular Expression Types for XML. In: Proc. of 5th ICFP, Montreal (Canada), vol.\u00a035(9), pp. 11\u201322. ACM, New York (2000)"},{"key":"15_CR12","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual, BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus (2001)"},{"key":"15_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-30210-0_14","volume-title":"Artificial Intelligence and Symbolic Computation","author":"T. Kutsia","year":"2004","unstructured":"Kutsia, T.: Solving Equations Involving Sequence Variables and Sequence Functions. In: Buchberger, B., Campbell, J.A. (eds.) AISC 2004. LNCS (LNAI), vol.\u00a03249, pp. 157\u2013170. Springer, Heidelberg (2004)"},{"key":"15_CR14","first-page":"225","volume-title":"Theoretical Computer Science","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D.: Multitree Automata That Count. In: Theoretical Computer Science, vol.\u00a0333(1\u20132), pp. 225\u2013263. Elsevier, Amsterdam (2005)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11965893_18","volume-title":"Database Theory \u2013 ICDT 2007","author":"S. Maneth","year":"2007","unstructured":"Maneth, S., Perst, T., Seidl, H.: XML Type Checking in Polynomial Time. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol.\u00a04353, pp. 254\u2013268. Springer, Heidelberg (2007)"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/jsco.1996.0011","volume":"21","author":"C. March\u00e9","year":"1996","unstructured":"March\u00e9, C.: Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations. Journal of Symbolic Computation\u00a021(3), 253\u2013288 (1996)","journal-title":"Journal of Symbolic Computation"},{"key":"15_CR17","first-page":"11","volume-title":"Proc. of 19th PODS","author":"T. Milo","year":"2000","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML Transformers. In: Proc. of 19th PODS, Dallas (Texas), pp. 11\u201322. ACM, New York (2000)"},{"key":"15_CR18","unstructured":"Murata, M.: Hedge Automata: A Formal Model for XML Schemata, draft (2000), available at \n                    \n                      http:\/\/citeseer.ist.psu.edu\/murata99hedge.html"},{"key":"15_CR19","unstructured":"Murata, M., Prescod, P.: SGML\/XML and Forest\/Hedge Automata Theory, Online Resource for Markup Language Technologies, Cover Pages, OASIS (May 2001), Online document available at \n                    \n                      http:\/\/xml.coverpages.org\/hedgeAutomata.html"},{"key":"15_CR20","unstructured":"Ohsaki, H., Seki, H.: Languages Modulo Normalization, draft (2007) Available at \n                    \n                      http:\/\/staff.aist.go.jp\/hitoshi.ohsaki\/"},{"key":"15_CR21","first-page":"97","volume-title":"Proc. of 5th RULE","author":"H. Ohsaki","year":"2005","unstructured":"Ohsaki, H., Takai, T.: ACTAS: A System Design for Associative and Commutative Tree Automata Theory. In: Proc. of 5th RULE, Aachen (Germany), vol.\u00a0ENTCS124, pp. 97\u2013111. Elsevier, Amsterdam (2005)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45610-4_9","volume-title":"Rewriting Techniques and Applications","author":"H. Ohsaki","year":"2002","unstructured":"Ohsaki, H., Takai, T.: Decidability and Closure Properties of Equational Tree Languages. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 114\u2013128. Springer, Heidelberg (2002)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-44802-0_38","volume-title":"Computer Science Logic","author":"H. Ohsaki","year":"2001","unstructured":"Ohsaki, H.: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 539\u2013553. Springer, Heidelberg (2001)"},{"issue":"4","key":"15_CR24","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On Context-Free Languages. JACM\u00a013(4), 570\u2013581 (1966)","journal-title":"JACM"},{"key":"15_CR25","first-page":"155","volume-title":"Proc. of 22nd PODS","author":"H. Seidl","year":"2003","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical Document Queries. In: Proc. of 22nd PODS, San Diego (California), pp. 155\u2013166. ACM Press, New York (2003)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"},{"issue":"4","key":"15_CR27","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing Derivation Trees of Context-Free Grammars Through a Generalization of Automata Theory. Journal of Computer and System Sciences\u00a01(4), 317\u2013322 (1967)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-44881-0_14","volume-title":"Rewriting Techniques and Applications","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 180\u2013197. Springer, Heidelberg (2003)"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-39813-4_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K.N. Verma","year":"2003","unstructured":"Verma, K.N.: On Closure under Complementation of Equational Tree Automata for Theories Extending AC. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 183\u2013197. Springer, Heidelberg (2003)"},{"key":"15_CR30","unstructured":"Extensible Markup Language (XML) Schema 1.0, 3rd edn., W3C (2004) Document available at \n                    \n                      http:\/\/www.w3.org\/TR\/2004\/REC-xml-20040204\/"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:30:40Z","timestamp":1619505040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746201","9783540746218"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}