Compressibility of Finite Languages by Grammars

DOI10.1007/978-3-319-19225-3_8zbMath1390.68388OpenAlexW955677872MaRDI QIDQ5500684

Stefan Hetzl, Sebastian Eberhard

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Complexity of proofs (03F20)

Related Items (5)

On the Herbrand content of LK ⋮ On the compressibility of finite languages and formal proofs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ On the cover complexity of finite languages ⋮ Inductive theorem proving based on tree grammars

Cites Work

• Algorithmic introduction of quantified cuts
• Rigid tree automata and applications
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Automaticity. I: Properties of a measure of descriptional complexity
• A fully linear-time approximation algorithm for grammar-based compression
• Algorithmics on SLP-compressed strings: A survey
• Applying Tree Languages in Proof Theory
• Towards Algorithmic Cut-Introduction
• Introducing Quantified Cuts in Logic with Equality
• Twelve Problems in Proof Complexity
• The Smallest Grammar Problem
• Rigid Tree Automata
• Lower Bounds on Herbrand's Theorem
• Grammar-based codes: a new class of universal lossless source codes
• Approximation of Grammar-Based Compression via Recompression
• A really Simple Approximation of Smallest Grammar
• The macro model for data compression (Extended Abstract)
• Minimal cover-automata for finite languages
• On Herbrand's theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compressibility of Finite Languages by Grammars