{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:16:16Z","timestamp":1760015776659},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"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-21493-6_16","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T12:42:44Z","timestamp":1308573764000},"page":"247-260","source":"Crossref","is-referenced-by-count":3,"title":["Variable Tree Automata over Infinite Ranked Alphabets"],"prefix":"10.1007","author":[{"given":"Irini-Eleftheria","family":"Mens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Rahonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"7","volume-title":"Proceedings of the Symposium on Logic in Computer Science (LICS 2006)","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on words with data. In: Proceedings of the Symposium on Logic in Computer Science (LICS 2006), pp. 7\u201316. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516515","volume":"56","author":"M. Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and xml reasoning. J. ACM\u00a056, 1\u201348 (2009)","journal-title":"J. ACM"},{"key":"16_CR3","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":"16_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquema, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"Damm, W.: The IO and OI-hierarchies. Theoret. Comput. Sci.\u00a020, 95\u2013207 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR6","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. J. Comput. System Sci.\u00a04, 406\u2013451 (1970)","journal-title":"J. Comput. System Sci."},{"key":"16_CR7","unstructured":"Engelfriet, J.: Tree automata and tree grammars. DAIMI FN-10 (Lecture Notes), Aarhus University (1975)"},{"key":"16_CR8","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O. Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 561\u2013572. Springer, Heidelberg (2010)"},{"key":"16_CR11","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets, \n                    \n                      http:\/\/www.cs.huji.ac.il\/~ornak\/publications\/lata10.pdf"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Math. Systems Theory\u00a016, 237\u2013263 (1983)","journal-title":"Math. Systems Theory"},{"key":"16_CR13","first-page":"131","volume-title":"Proceedings of LICS 2007","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternation-free modal mu-calculus for data trees. In: Proceedings of LICS 2007, pp. 131\u2013140. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoret. Comput. Sci.\u00a0134, 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR15","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. Inform. Control\u00a011, 3\u201329 (1967)","journal-title":"Inform. Control"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F. Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 560\u2013572. Springer, Heidelberg (2001)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log.\u00a05, 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(94)90099-X","volume":"127","author":"K. Salomaa","year":"1994","unstructured":"Salomaa, K.: Synchronized tree automata. Theoret. Comput. Sci.\u00a0127, 25\u201351 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1006\/inco.1994.1085","volume":"114","author":"Y. Shemesh","year":"1994","unstructured":"Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Infom. and Comput.\u00a0114, 192\u2013213 (1994)","journal-title":"Infom. and Comput."},{"key":"16_CR20","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 theory with application to a decision problem of second-order logic. Math. Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T07:06:44Z","timestamp":1553843204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}