DBScholar

Back to papers

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)

Paper ID
1432
Venue
PODS
Year
2007
Pagerank
5.3099552e-05
Overall Rank
9,168 | 37.10%
DOI
10.1145/1265530.1265564

Incoming Non-self Citations Over Time

Authors

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.

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