Compressibility of Finite Languages by Grammars

DOI10.1007/978-3-319-19225-3_8MaRDI QIDQ5500684zbMATH OpenOpenAlexFDO

Authors Sebastian Eberhard, Stefan Hetzl

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

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

Recommendations

• On the compressibility of finite languages and formal proofs
• On the complexity of grammar-based compression over fixed alphabets
• Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
• scientific article; zbMATH DE number 2119662
• On the grammatical complexity of finite languages
• A space-optimal grammar compression
• Approximation of Grammar-Based Compression via Recompression
• Approximation of grammar-based compression via recompression
• Context-free complexity of finite languages
• A fully linear-time approximation algorithm for grammar-based compression

Cites work

• A fully linear-time approximation algorithm for grammar-based compression
• A really simple approximation of smallest grammar
• Algorithmic introduction of quantified cuts
• Algorithmics on SLP-compressed strings: a survey
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Applying tree languages in proof theory
• Approximation of Grammar-Based Compression via Recompression
• Automaticity. I: Properties of a measure of descriptional complexity
• Grammar-based codes: a new class of universal lossless source codes
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3668590 (Why is no real title available?)
• scientific article; zbMATH DE number 1215493 (Why is no real title available?)
• scientific article; zbMATH DE number 1215500 (Why is no real title available?)
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• scientific article; zbMATH DE number 1747450 (Why is no real title available?)
• scientific article; zbMATH DE number 1452982 (Why is no real title available?)
• Introducing quantified cuts in logic with equality
• Lower Bounds on Herbrand's Theorem
• Minimal cover-automata for finite languages
• On Herbrand's theorem
• Rigid Tree Automata
• Rigid tree automata and applications
• The macro model for data compression (extended abstract)
• The Smallest Grammar Problem
• Towards Algorithmic Cut-Introduction
• Twelve Problems in Proof Complexity

Cited in

(6)

• 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
• Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
• On the Herbrand content of LK

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500684)