Two-way unary automata versus logarithmic space (Q549665): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61677514, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4139689 / 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: Converting two-way nondeterministic unary automata into simpler automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size Complexity of Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way deterministic finite automata are exponentially more succinct than sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Nondeterminism Unambiguous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with sublogarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary finite automata vs. arithmetic progressions / rank
 
Normal rank

Latest revision as of 06:45, 4 July 2024

scientific article
Language Label Description Also known as
English
Two-way unary automata versus logarithmic space
scientific article

    Statements

    Two-way unary automata versus logarithmic space (English)
    0 references
    0 references
    0 references
    18 July 2011
    0 references
    unary regular languages
    0 references
    finite automata
    0 references
    state complexity
    0 references
    logarithmic space
    0 references
    space complexity
    0 references

    Identifiers