{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T05:11:34Z","timestamp":1738041094204,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781264"},{"type":"electronic","value":"9783540781271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78127-1_21","type":"book-chapter","created":{"date-parts":[[2008,2,7]],"date-time":"2008-02-07T12:59:40Z","timestamp":1202389180000},"page":"386-423","source":"Crossref","is-referenced-by-count":15,"title":["Tree Automata over Infinite Alphabets"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaminski","sequence":"first","affiliation":[]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0306-4379(01)00033-3","volume":"27","author":"G.J. Bex","year":"2002","unstructured":"Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information and System\u00a027(1), 21\u201339 (2002)","journal-title":"Information and System"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"E.Y.C. Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica\u00a035, 245\u2013267 (1998)","journal-title":"Acta Informatica"},{"key":"21_CR3","unstructured":"Comon, H., et al.: Tree Automata Techniques and Applications (2005), http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J.E. Doner","year":"1970","unstructured":"Doner, J.E.: Tree acceptors and some of their applications. Journal of Computer and System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR5","first-page":"683","volume-title":"Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Kaminski","year":"1990","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, pp. 683\u2013688. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"138","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science\u00a0138, 329\u2013363 (1994)","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.3233\/FUN-2006-69304","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundamenta Informaticae\u00a069, 301\u2013318 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Type checking for XML transformers. Journal of Computer and System Sciences\u00a066, 66\u201397 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR9","first-page":"145","volume-title":"Proceedings of the Nineteenth International Symposium on Principles of Database Systems","author":"F. Neven","year":"2000","unstructured":"Neven, F., Schwentick, T.: Expressive and efficient pattern languages for tree-structured data. In: Proceedings of the Nineteenth International Symposium on Principles of Database Systems, pp. 145\u2013156. ACM Press, New York (2000)"},{"key":"21_CR10","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":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"key":"21_CR12","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 on finite trees. Theoretical Computer Science\u00a0275, 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR13","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 Transactions on Computational Logic\u00a05, 403\u2013435 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"21_CR14","first-page":"35","volume-title":"Proceedings of the Twentieth International Symposium on Principles of Database Systems","author":"Y. Papakonstantinou","year":"2001","unstructured":"Papakonstantinou, Y., Vianu, V.: DTD inference for views of XML data. In: Proceedings of the Twentieth International Symposium on Principles of Database Systems, pp. 35\u201346. ACM Press, New York (2001)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"21_CR16","volume-title":"Learning XML.","author":"E. Ray","year":"2001","unstructured":"Ray, E.: Learning XML. O\u2019Reilly & Associates, Inc, Sebastopol (2001)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J. Thatcher","year":"1968","unstructured":"Thatcher, J., Wright, J.: Generalized finite automata theory. Mathematical System Theory\u00a02, 57\u201381 (1968)","journal-title":"Mathematical System Theory"},{"key":"21_CR18","first-page":"1","volume-title":"Proceedings of the 20th International Symposium on Principles of Database Systems","author":"V. Vianu","year":"2001","unstructured":"Vianu, V.: A web odyssey: from Codd to XML. In: Proceedings of the 20th International Symposium on Principles of Database Systems, pp. 1\u201315. ACM Press, New York (2001)"},{"key":"21_CR19","unstructured":"XML Core Working Group: Extensible Markup Language (XML). World Wide Web Consortium, http:\/\/www.w3.org\/XML\/"},{"key":"21_CR20","unstructured":"Zeitlin, D.: Look-ahead finite-memory automata. Master\u2019s thesis, Department of Computer Science, Technion - Israel Institute of Technology (2006)"}],"container-title":["Lecture Notes in Computer Science","Pillars of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78127-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T04:34:57Z","timestamp":1737952497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78127-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781264","9783540781271"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78127-1_21","relation":{},"subject":[]}}