Tree automata over infinite alphabets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4800 LNCS, Issue , 2008, Pages 386-423

  Kaminski, Michael ^a   Tan, Tony ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

TECHNOLOGY;

COMPUTATION POWER; MODELS OF COMPUTATION; TREE AUTOMATON;

COMPUTER SCIENCE;

EID: 49949087321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78127-1_21     Document Type: Conference Paper

References (20)

1. Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Information and System 27(1), 21-39 (2002)
2. Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245-267 (1998)
3. Comon, H., et al.: Tree Automata Techniques and Applications (2005), http://www.grappa.univ-lille3.fr/tata/
4. Doner, J.E.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4, 406-451 (1970)
5. 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)
6. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 138, 329-363 (1994)
7. Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundamenta Informaticae 69, 301-318 (2006)
8. Milo, T., Suciu, D., Vianu, V.: Type checking for XML transformers. Journal of Computer and System Sciences 66, 66-97 (2003)
9. 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)
10. 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)
11. 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)
12. Neven, F., Schwentick, T.: Query automata on finite trees. Theoretical Computer Science 275, 633-674 (2002)
13. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5, 403-435 (2004)
14. 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)
15. Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1-35 (1969)
16. Ray, E.: Learning XML. O'Reilly & Associates, Inc, Sebastopol (2001)
17. Thatcher, J., Wright, J.: Generalized finite automata theory. Mathematical System Theory 2, 57-81 (1968)
18. 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)
19. XML Core Working Group: Extensible Markup Language (XML). World Wide Web Consortium, http://www.w3.org/XML/
20. Zeitlin, D.: Look-ahead finite-memory automata. Master's thesis, Department of Computer Science, Technion - Israel Institute of Technology (2006)