Marrying words and trees

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 233-242

  Alur, Rajeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Nested words; Pushdown automata; Query languages; Tree automata; XML

Indexed keywords

NESTED WORDS; PUSHDOWN AUTOMATA; TREE AUTOMATA;

AUTOMATA THEORY; HIERARCHICAL SYSTEMS; QUERY LANGUAGES; XML;

TREES (MATHEMATICS);

EID: 35448975635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265564     Document Type: Conference Paper

References (19)

1. R. Alur, S. Chaudhuri, and P. Madhusudan. Languages of nested trees. In Proc. 18th International Conference on Computer-Aided Verification, LNCS 4144, pages 329-342. Springer, 2006.
2. R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan. Congruences for visibly pushdown languages. In Automata, Languages and Programming: Proceedings of the 32nd ICALP, LNCS 3580, pages 1102-1114. Springer, 2005.
3. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proceedings of the 36th ACM Symposium on Theory of Computing, pages 202-211, 2004.
4. R. Alur and P. Madhusudan. Adding nesting structure to words. In Developments in Language Theory, LNCS 4036, pages 1-13, 2006.
5. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
6. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Draft, Available at http://www.grappa.univ-lille3.fr/tata/, 2002.
7. T. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. In ICDT '03: Proceedings of the 9th International Conference on Database Theory, pages 173-189. Springer, 2003.
8. I. Guessarian. Pushdown tree automata. Mathematical Systems Theory, 16:237-264, 1983.
9. D. Knuth. A characterization of parenthesis languages. Information and Control, 11(3):269-289, 1967.
10. V. Kumar, P. Madhusudan, and M. Viswanathan. Minimization, learning, and conformance testing of Boolean programs. In CONCUR'06: 17th International Conference on Concurrency Theory, LNCS 4137, pages 203-217. Springer, 2006.
11. V. Kumar, P. Madhusudan, and M. Viswanathan. Visibly pushdown languages for streaming XML. In Proceedings of the 16th International World Wide Web Conference, 2007.
12. O. Kupferman, N. Piterman, and M. Vardi. Pushdown specifications. In Proc. 9th Intl. Conf. on Logics for Programming, Artificial Intelligence, and Reasoning, LNCS 2514, "pages 262-277. Springer, 2002.
13. L. Libkin. Logics for unranked trees: An overview. In Automata, Languages and Programming, 32nd International Colloquium, Proceedings, LNCS 3580, pages 35-50. Springer, 2005.
14. C. Löding, P. Madhusudan, and O. Serre. Visibly pushdown games. In FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, LNCS 3328, pages 408-420. Springer, 2004.
15. W. Martens and J. Niehren. Minimizing tree automata for unranked trees. In Proceedings of the 10th International Symposium on Database Programming Languages, pages 233-247, 2005.
16. R. McNaughton. Parenthesis grammars. Journal of the ACM, 14(3):490-500, 1967.
17. F. Neven. Automata, logic, and XML. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, pages 2-26. Springer, 2002.
18. T. Schwentick. Automata for XML - a survey. Technical report, University of Dortmund, 2004.
19. W. Thomas. On logics, tilings, and automata. In Automata, Languages and Programming, 18th Intl. Colloquium, LNCS 510, pages 441-454, 1991.