{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:09Z","timestamp":1725566649550},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_36","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"500-515","source":"Crossref","is-referenced-by-count":7,"title":["Automata and Logics for Unranked and Unordered Trees"],"prefix":"10.1007","author":[{"given":"Iovka","family":"Boneva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","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. 105\u2013118. Springer, Heidelberg (2004)"},{"key":"36_CR2","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Rewriting in the partial algebra of typed terms modulo AC","author":"T. Colcombet","year":"2002","unstructured":"Colcombet, T.: Rewriting in the partial algebra of typed terms modulo AC. Electronic Notes in Theoretical Computer Science, vol.\u00a068. Elsevier Science Publishers, Amsterdam (2002)"},{"key":"36_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), Available on: \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata\n                  \n                  \n                 (release October 1, 2002)"},{"issue":"1","key":"36_CR4","first-page":"12","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. IC\u00a085(1), 12\u201375 (1990)","journal-title":"IC"},{"issue":"2-3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(94)90019-1","volume":"54","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Applied Mathematics\u00a054(2-3), 117\u2013149 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00145-X","volume":"163","author":"B. Courcelle","year":"1996","unstructured":"Courcelle, B.: Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science\u00a0163, 1\u201354 (1996)","journal-title":"Theoretical Computer Science"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"S. Dal-Zilio","year":"2003","unstructured":"Dal-Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Dal-Zilio, S., Lugiez, D., Meyssonnier, C.: A logic you can count on. In: 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004)","DOI":"10.1145\/964001.964013"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1006\/jcss.1999.1634","volume":"59","author":"S. Gaubert","year":"1999","unstructured":"Gaubert, S., Giua, A.: Petri net languages and infinite subsets of Nm. Journal of Computer System Sciences\u00a059(3), 373\u2013391 (1999)","journal-title":"Journal of Computer System Sciences"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0020789","volume-title":"STACS 91","author":"G. Guaiana","year":"1991","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: On Aperiodic Trace Languages. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 76\u201388. Springer, Heidelberg (1991)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F. Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic Second-Order Logics with Cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, Springer, Heidelberg (2003)"},{"issue":"2-3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Information and Control\u00a011(2-3), 3\u201329 (1967)","journal-title":"Information and Control"},{"issue":"1-2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science\u00a0275(1-2), 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-56610-4_76","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"J. Niehren","year":"1993","unstructured":"Niehren, J., Podelski, A.: Feature Automata and Recognizable Sets of Feature Trees. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 356\u2013375. Springer, Heidelberg (1993)"},{"key":"36_CR15","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)"},{"key":"36_CR16","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)"},{"issue":"4","key":"36_CR17","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. Journal of the ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"Journal of the ACM"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/773153.773169","volume-title":"Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"H. Seidl","year":"2003","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical Document Queries. In: Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 155\u2013166. ACM Press, New York (2003)"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory\u00a02, 57\u201382 (1968)","journal-title":"Mathematical System Theory"},{"key":"36_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:45:36Z","timestamp":1620013536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}