ABSTRACT
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this paper, we argue that nested words and automata over nested words offer a better way to capture and process the dual structure. Nested words generalize both words and ordered trees, and allow both word and tree operations. We study various classes of automata over nested words, and show that while they enjoy expressiveness and succinctness benefits over word and tree automata, their analysis complexity and closure properties are analogous to the corresponding word and tree special cases. In particular, we show that finite-state nested word automata can be exponentially more succinct than tree automata, and pushdown nested word automata include the two incomparable classes of context-free word languages and context-free tree languages.
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- R. Alur and P. Madhusudan. Visibly pushdown languages. In Proceedings of the 36th ACM Symposium on Theory of Computing, pages 202--211, 2004. Google Scholar
Digital Library
- R. Alur and P. Madhusudan. Adding nesting structure to words. In Developments in Language Theory, LNCS 4036, pages 1--13, 2006. Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- I. Guessarian. Pushdown tree automata. Mathematical Systems Theory, 16:237--264, 1983.Google Scholar
Cross Ref
- D. Knuth. A characterization of parenthesis languages. Information and Control, 11(3):269--289, 1967.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- V. Kumar, P. Madhusudan, and M. Viswanathan. Visibly pushdown languages for streaming XML. In Proceedings of the 16th International World Wide Web Conference, 2007. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- L. Libkin. Logics for unranked trees: An overview. In Automata, Languages and Programming, 32nd International Colloquium, Proceedings, LNCS 3580, pages 35--50. Springer, 2005. Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- R. McNaughton. Parenthesis grammars. Journal of the ACM, 14(3):490--500, 1967. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- T. Schwentick. Automata for XML -- a survey. Technical report, University of Dortmund, 2004.Google Scholar
- W. Thomas. On logics, tilings, and automata. In Automata, Languages and Programming, 18th Intl. Colloquium, LNCS 510, pages 441--454, 1991. Google Scholar
Digital Library
Index Terms
Marrying words and trees
Recommendations
Adding nesting structure to words
We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include executions of structured programs, annotated ...
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Nested words provide a natural model of runs of programs with recursive procedure calls. The usual connection between monadic second-order logic (MSO) and automata extends from words to nested words and gives us a natural notion of regular languages of ...
Relating word and tree automata
LICS '96: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer ScienceIn the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata. Already in the 60's, it was known that deterministic Buchi word automata ...






Comments