On the compressibility of finite languages and formal proofs (Q1706152): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2017.09.001 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q113872847 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2017.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2751273904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The macro model for data compression (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Grammar-Based Compression over Fixed Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully linear-time approximation algorithm for grammar-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of grammar-based compression via recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \textit{really} simple approximation of smallest grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise description of finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a problem in the theory of grammatical complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower-bound for the number of productions required for a certain class of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free complexity of finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the context-free production complexity of finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Tree Languages in Proof Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Algorithmic Cut-Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic introduction of quantified cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing Quantified Cuts in Logic with Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cover-automata for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twelve Problems in Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressibility of Finite Languages by Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid tree automata and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3618853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of proof lines and the size of proofs in first order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Herbrand's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The epsilon calculus and Herbrand complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of resolution proofs and function introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the form of witness terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrand Confluence for First-Order Proofs with Π<sub>2</sub>-Cuts / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2017.09.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:06, 11 December 2024

scientific article
Language Label Description Also known as
English
On the compressibility of finite languages and formal proofs
scientific article

    Statements

    On the compressibility of finite languages and formal proofs (English)
    0 references
    0 references
    0 references
    21 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers