A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
Summary: Establishes a doubly-exponential gap: finite languages admit general CFG representations that are doubly-exponentially smaller than unambiguous CFGs. Develops a non-standard communication-complexity reduction with a discrepancy-style lower bound, showing NFAs can be exponentially smaller than unambiguous CFGs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Stefan Mengel (National Centre for Scientific Research; University of Artois)
- 2. Harry Vinall-Smeeth (Ilmenau University of Technology)
BibTeX Citation
@inproceedings{mengel_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity}},
url = {https://dl.acm.org/doi/10.1145/3725225},
doi = {10.1145/3725225},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Mengel, Stefan and Vinall-Smeeth, Harry},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 521 | Learning Linear Regression Models over Factorized Joins | 2016 | SIGMOD | 0.00016929744 |
| 637 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00015341557 |
| 849 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013504405 |
| 4,789 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.413875e-05 |
| 9,074 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 5.2283159e-05 |
| 9,083 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS | 5.2283159e-05 |
| 9,084 | Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments | 2022 | PODS | 5.2283159e-05 |
| 9,085 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 5.2283159e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,445 | Query Automata (extended abstract) | 1999 | PODS |
| 2 | 6,917 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS |
| 3 | 11,098 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS |
| 4 | 6,798 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS |
| 5 | 1,919 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS |
| 6 | 7,811 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |
| 7 | 8,005 | New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions | 1994 | PODS |
| 8 | 11,834 | Data Path Queries over Embedded Graph Databases | 2022 | PODS |
| 9 | 3,538 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS |
| 10 | 9,085 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |