Compressibility of Finite Languages by Grammars (Q5500684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W955677872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Herbrand's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cover-automata for finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Tree Languages in Proof Theory / 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: Algorithmic introduction of quantified cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Algorithmic Cut-Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid tree automata and applications / 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 really Simple Approximation of Smallest Grammar / 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: Algorithmics on SLP-compressed strings: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386970 / 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: Twelve Problems in Proof Complexity / 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: A fully linear-time approximation algorithm for grammar-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaticity. I: Properties of a measure of descriptional complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Herbrand's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The macro model for data compression (Extended Abstract) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:55, 10 July 2024

scientific article; zbMATH DE number 6471670
Language Label Description Also known as
English
Compressibility of Finite Languages by Grammars
scientific article; zbMATH DE number 6471670

    Statements

    Compressibility of Finite Languages by Grammars (English)
    0 references
    0 references
    0 references
    7 August 2015
    0 references

    Identifiers