The complexity of compressed membership problems for finite automata (Q2254509)

From MaRDI portal
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
    0 references
    0 references
    0 references
    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
    0 references
    0 references