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
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 |
|---|---|---|---|---|
| 770 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001686092 |
| 832 | Learning Linear Regression Models over Factorized Joins | 2016 | SIGMOD | 0.00016089705 |
| 1,255 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013011216 |
| 3,566 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.9623808e-05 |
| 8,734 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 4.4520434e-05 |
| 8,748 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS | 4.4520434e-05 |
| 8,749 | Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments | 2022 | PODS | 4.4520434e-05 |
| 8,750 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 4.4520434e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,959 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS | 4.6089395e-05 |
| 5,874 | Query Automata (extended abstract) | 1999 | PODS | 5.2893146e-05 |
| 10,374 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 4.1905499e-05 |
| 6,795 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS | 4.9197522e-05 |
| 1,833 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 0.00010365844 |
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4369334e-05 |
| 7,782 | New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions | 1994 | PODS | 4.6479178e-05 |
| 11,328 | Data Path Queries over Embedded Graph Databases | 2022 | PODS | 4.1905499e-05 |
| 2,297 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 9.0812384e-05 |
| 8,750 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 4.4520434e-05 |