Marrying Words and Trees
Summary: Use nested words to unify linear and hierarchical data and define automata that generalize both word and ordered-tree automata. Show finite-state nested-word automata can be exponentially more succinct than tree automata, and pushdown variants subsume both context-free word and context-free tree languages while analysis complexity and closure properties remain analogous to the classical cases. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rajeev Alur (University of Pennsylvania)
BibTeX Citation
@inproceedings{alur_pods07,
address = {New York, NY, USA},
series = {{PODS} '07},
title = {{Marrying Words and Trees}},
url = {https://dl.acm.org/doi/10.1145/1265530.1265564},
doi = {10.1145/1265530.1265564},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Alur, Rajeev},
year = {2007}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,409 | From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences | 2010 | VLDB | 5.6243e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,752 | Effective Characterizations of Tree Logics | 2008 | PODS |
| 2 | 1,856 | Automata Theory for Database Theoreticians | 1989 | PODS |
| 3 | 8,924 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |
| 4 | 12,624 | Expressiveness and Complexity of XML Publishing Transducers | 2007 | PODS |
| 5 | 5,346 | Running Tree Automata on Probabilistic XML | 2009 | PODS |
| 6 | 6,442 | XPath, Transitive Closure Logic, and Nested Tree Walking Automata | 2008 | PODS |
| 7 | 13,875 | Trees, Automata and XML (Invited Tutorial) | 2004 | PODS |
| 8 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 9 | 6,318 | Query Automata (extended abstract) | 1999 | PODS |
| 10 | 7,919 | Stackless Processing of Streamed Trees | 2021 | PODS |