A note on the space complexity of some decision problems for finite automata (Q1183428): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Two-way automata and length-preserving homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a complexity hierarchy between L and NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of finite-state automata problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation with a pebble / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to a Unified Theory of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Revision as of 14:47, 15 May 2024

scientific article
Language Label Description Also known as
English
A note on the space complexity of some decision problems for finite automata
scientific article

    Statements

    A note on the space complexity of some decision problems for finite automata (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    pebble automaton
    0 references
    decision problem
    0 references
    computational complexity
    0 references

    Identifiers