On the compressibility of finite languages and formal proofs

DOI10.1016/J.IC.2017.09.001MaRDI QIDQ1706152zbMATH OpenOpenAlexWikidataFDO

Authors Sebastian Eberhard, Stefan Hetzl

Publication date 21 March 2018

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2017.09.001

Mathematics Subject Classification ID

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

Recommendations

• Compressibility of Finite Languages by Grammars
• On minimal grammar problems for finite languages
• On the cover complexity of finite languages
• On the grammatical complexity of finite languages
• scientific article; zbMATH DE number 4028929

Cites work

• scientific article; zbMATH DE number 5539366 (Why is no real title available?)
• 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 1215500 (Why is no real title available?)
• scientific article; zbMATH DE number 1342207 (Why is no real title available?)
• scientific article; zbMATH DE number 627412 (Why is no real title available?)
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• A \textit{really} simple approximation of smallest grammar
• A fully linear-time approximation algorithm for grammar-based compression
• A lower-bound for the number of productions required for a certain class of languages
• A note on a problem in the theory of grammatical complexity
• 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
• Automated Reasoning
• Complexity of resolution proofs and function introduction
• Compressibility of Finite Languages by Grammars
• Concise description of finite languages
• Context-free complexity of finite languages
• Grammar-based codes: a new class of universal lossless source codes
• Herbrand Confluence for First-Order Proofs with Π₂-Cuts
• Herbrand disjunctions, cut elimination and context-free tree grammars
• Introducing quantified cuts in logic with equality
• Lower Bounds on Herbrand's Theorem
• Minimal cover-automata for finite languages
• On the complexity of grammar-based compression over fixed alphabets
• On the context-free production complexity of finite languages
• On the form of witness terms
• Proof theory. 2nd ed
• Rigid tree automata and applications
• The Smallest Grammar Problem
• The epsilon calculus and Herbrand complexity
• The macro model for data compression (extended abstract)
• The number of proof lines and the size of proofs in first order logic
• Towards Algorithmic Cut-Introduction
• Twelve Problems in Proof Complexity
• Untersuchungen über das logische Schliessen. II

Cited in

(8)

• Inductive theorem proving based on tree grammars
• On the cover complexity of finite languages
• On the Herbrand content of LK
• scientific article; zbMATH DE number 1998343 (Why is no real title available?)
• scientific article; zbMATH DE number 7564405 (Why is no real title available?)
• On minimizing regular expressions without Kleene star
• Compressibility of Finite Languages by Grammars
• Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen

This page was built for publication: On the compressibility of finite languages and formal proofs

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