DBScholar

Back to papers

Automata Theory for Database Theoreticians

Summary: Argues for (re)adoption of automata theory—word and tree automata, constructions, closures—as core tools for DB theory. Shows concrete automata-based analyses and decidability techniques to address Datalog predicate emptiness, termination, and boundedness. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
852
Venue
PODS
Year
1989
Pagerank
9.6053834e-05
Overall Rank
1,856 | 87.27%
DOI
10.1145/73721.73729

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{vardi_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Automata Theory for Database Theoreticians}},
        url = {https://dl.acm.org/doi/10.1145/73721.73729},
        doi = {10.1145/73721.73729},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Vardi, Moshe Y.},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers