The complexity of compressed membership problems for finite automata (Q2254509): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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.1007/s00224-013-9443-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1755286175 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59394998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128934 / 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: Q5365049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smallest Grammar Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-method dispatching / 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: Q5365048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Efficient LZW-Compressed Multiple Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching and membership for hierarchical message sequence charts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Fully Compressed Pattern Matching by Recompression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of equations over sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-nonterminal conjunctive grammars over a unary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching in compressed texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes / 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: COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA / 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: Compressed Membership in Automata with Compressed Labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation in Groups Via Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining dynamic sequences under equality tests in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and flexible pattern matching over Ziv-Lempel compressed text. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of word equations with constants is in PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219050 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:33, 9 July 2024

scientific article
Language Label Description Also known as
English
The complexity of compressed membership problems for finite automata
scientific article

    Statements

    The complexity of compressed membership problems for finite automata (English)
    0 references
    0 references
    5 February 2015
    0 references
    compressed membership problem
    0 references
    SLP
    0 references
    finite automata
    0 references
    algorithms for compressed data
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers