Leaf languages and string compression (Q550251): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2011.01.009 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997488434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Monoids: From Word to Circuit Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal properties of XML grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct circuit representations and leaf language classes are basically the same concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to define complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced versus unbalanced computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace and logtime leaf languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterated mod problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Second-Order Monadic Monoidal and Groupoidal Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing Compressed Texts: A Tractability Border / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying and Embedding Compressed Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leaf languages and string compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTIME-complete matching problem for SLP-compressed words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941166 / 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: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation, leaf languages, and projection reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2011.01.009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:19, 9 December 2024

scientific article
Language Label Description Also known as
English
Leaf languages and string compression
scientific article

    Statements

    Leaf languages and string compression (English)
    0 references
    0 references
    8 July 2011
    0 references
    leaf languages
    0 references
    straight-line programs
    0 references
    compressed string
    0 references
    complexity theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers