Abstract
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information and System 27(1), 21–39 (2002)
Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245–267 (1998)
Comon, H., et al.: Tree Automata Techniques and Applications (2005), http://www.grappa.univ-lille3.fr/tata/
Doner, J.E.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406–451 (1970)
Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, pp. 683–688. IEEE Computer Society Press, Los Alamitos (1990)
Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 138, 329–363 (1994)
Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundamenta Informaticae 69, 301–318 (2006)
Milo, T., Suciu, D., Vianu, V.: Type checking for XML transformers. Journal of Computer and System Sciences 66, 66–97 (2003)
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–156. ACM Press, New York (2000)
Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 560–572. Springer, Heidelberg (2001)
Neven, F.: Automata, logic and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Neven, F., Schwentick, T.: Query automata on finite trees. Theoretical Computer Science 275, 633–674 (2002)
Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5, 403–435 (2004)
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–46. ACM Press, New York (2001)
Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)
Ray, E.: Learning XML. O’Reilly & Associates, Inc, Sebastopol (2001)
Thatcher, J., Wright, J.: Generalized finite automata theory. Mathematical System Theory 2, 57–81 (1968)
Vianu, V.: A web odyssey: from Codd to XML. In: Proceedings of the 20th International Symposium on Principles of Database Systems, pp. 1–15. ACM Press, New York (2001)
XML Core Working Group: Extensible Markup Language (XML). World Wide Web Consortium, http://www.w3.org/XML/
Zeitlin, D.: Look-ahead finite-memory automata. Master’s thesis, Department of Computer Science, Technion - Israel Institute of Technology (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kaminski, M., Tan, T. (2008). Tree Automata over Infinite Alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-78127-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78126-4
Online ISBN: 978-3-540-78127-1
eBook Packages: Computer ScienceComputer Science (R0)