Abstract
We consider the problem of simultaneously compressing a finite set of words by a single grammar. The central result of this paper is the construction of an incompressible sequence of finite word languages. This result is then shown to transfer to tree languages and (via a previously established connection between proof theory and formal language theory) also to formal proofs in first-order predicate logic.
Cite
CITATION STYLE
Eberhard, S., & Hetzl, S. (2015). Compressibility of finite languages by grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9118, pp. 93–104). Springer Verlag. https://doi.org/10.1007/978-3-319-19225-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
