On the Size Complexity of Rotating and Sweeping Automata (Q3533032): 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: Complementing 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: Two-way deterministic finite automata are exponentially more succinct than sweeping automata / 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: Lower bounds on the size of sweeping automata / rank
 
Normal rank

Latest revision as of 18:24, 28 June 2024

scientific article
Language Label Description Also known as
English
On the Size Complexity of Rotating and Sweeping Automata
scientific article

    Statements

    Identifiers