{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:09Z","timestamp":1725796569880},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319089171"},{"type":"electronic","value":"9783319089188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08918-8_11","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T05:44:22Z","timestamp":1404279862000},"page":"149-163","source":"Crossref","is-referenced-by-count":1,"title":["Tree Automata with Height Constraints between Brothers"],"prefix":"10.1007","author":[{"given":"Carles","family":"Creus","sequence":"first","affiliation":[]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_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, New York (1998)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bargu\u00f1\u00f3, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: Decidable classes of tree automata mixing local and global constraints modulo flat theories. Logical Methods in Computer Science\u00a09(2) (2013)","DOI":"10.2168\/LMCS-9(2:1)2013"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-55210-3_181","volume-title":"STACS 92","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and Disequality Constraints on Direct Subterms in Tree Automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-48685-2_9","volume-title":"Rewriting Techniques and Applications","author":"A.-C. Caron","year":"1999","unstructured":"Caron, A.-C., Seynhaeve, F., Tison, S., Tommasi, M.: Deciding the satisfiability of quantifier free formulae on one-step rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 103\u2013117. Springer, Heidelberg (1999)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0890-5401(03)00134-2","volume":"187","author":"H. Comon","year":"2003","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Information and Computation\u00a0187(1), 123\u2013153 (2003)","journal-title":"Information and Computation"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"H. Comon","year":"2005","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science\u00a0331(1), 143\u2013214 (2005)","journal-title":"Theoretical Computer Science"},{"key":"11_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), \n                  \n                    http:\/\/tata.gforge.inria.fr"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Visibly tree automata with memory and constraints. Logical Methods in Computer Science 4(2:8) (2008)","DOI":"10.2168\/LMCS-4(2:8)2008"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Creus, C., Gasc\u00f3n, A., Godoy, G., Ramos, L.: The HOM problem is EXPTIME-complete. In: Logic in Computer Science (LICS), pp. 255\u2013264 (2012)","DOI":"10.1109\/LICS.2012.36"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1006\/jsco.1995.1048","volume":"20","author":"M. Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.C., Coquid\u00e9, J.L.: Automata for reduction properties solving. Journal of Symbolic Computation\u00a020(2), 215\u2013233 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. Journal of Computer System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer System Sciences"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905411000743X","volume":"21","author":"E. Filiot","year":"2010","unstructured":"Filiot, E., Talbot, J., Tison, S.: Tree automata with global constraints. International Journal of Foundations of Computer Science\u00a021(4), 571\u2013596 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR13","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3 (1984)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/2508028.2501600","volume":"60","author":"G. Godoy","year":"2013","unstructured":"Godoy, G., Gim\u00e9nez, O.: The HOM problem is decidable. Journal of the ACM\u00a060(4), 23 (2013)","journal-title":"Journal of the ACM"},{"issue":"2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.jlap.2007.10.006","volume":"75","author":"F. Jacquemard","year":"2008","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Journal of Logic and Algebraic Programming\u00a075(2), 182\u2013208 (2008)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"11_CR17","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, 3\u201329 (1967)","journal-title":"Information and Control"},{"key":"11_CR18","unstructured":"Mongy, J.: Transformation de noyaux reconnaissables d\u2019arbres. For\u00eats RATEG. Ph.D. thesis, Laboratoire d\u2019Informatique Fondamentale de Lille, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d\u2019Ascq, France (1981)"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/1111627.1111631","volume":"5","author":"M. Murata","year":"2005","unstructured":"Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Transactions of Internet Technologies\u00a05(4), 660\u2013704 (2005)","journal-title":"ACM Transactions of Internet Technologies"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-46432-8_22","volume-title":"Foundation of Software Science and Computation Structures","author":"R. Treinen","year":"2000","unstructured":"Treinen, R.: Predicate logic and tree automata with tests. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 329\u2013343. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Rewriting and Typed Lambda Calculi"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08918-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T05:59:53Z","timestamp":1558936793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08918-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319089171","9783319089188"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08918-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}