Size complexity of rotating and sweeping automata (Q414916): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3938525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas II: Two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Sweeping 2NFAs Are Not Closed Under Complement / 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: An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size Complexity of Rotating and Sweeping Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplification of slight probabilistic advantage at absolutely no cost in space / 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: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank

Latest revision as of 05:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Size complexity of rotating and sweeping automata
scientific article

    Statements

    Size complexity of rotating and sweeping automata (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    finite automata
    0 references
    sweeping automata
    0 references
    size complexity
    0 references
    self-verification
    0 references
    randomization
    0 references
    hardness propagation
    0 references
    0 references