Size Complexity of Two-Way Finite Automata (Q3637213): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christos A. Kapoutsis / rank
Normal rank
 
Property / author
 
Property / author: Christos A. Kapoutsis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1497278126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139689 / rank
 
Normal rank
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: Finite automata and unary languages / 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: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / 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: Complementing two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / 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: Q4449194 / 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: Q3517105 / 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: Alternating Pushdown and Stack 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: Q4298260 / 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: Q5541340 / 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
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank

Latest revision as of 18:59, 1 July 2024

scientific article
Language Label Description Also known as
English
Size Complexity of Two-Way Finite Automata
scientific article

    Statements

    Size Complexity of Two-Way Finite Automata (English)
    0 references
    7 July 2009
    0 references
    0 references
    0 references