On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the descriptional complexity of stateless deterministic ordered restarting automata
scientific article

    Statements

    On the descriptional complexity of stateless deterministic ordered restarting automata (English)
    0 references
    0 references
    0 references
    21 March 2018
    0 references
    0 references
    restarting automaton
    0 references
    ordered rewriting
    0 references
    descriptional complexity
    0 references
    language operations
    0 references
    decision problems
    0 references
    transductions
    0 references
    rational functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references