Two-Way Automata versus Logarithmic Space
From MaRDI portal
Publication:3007639
DOI10.1007/978-3-642-20712-9_28zbMath1332.68117OpenAlexW1662891443MaRDI QIDQ3007639
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_28
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Two-way automata making choices only at the endmarkers ⋮ Nondeterminism Is Essential in Small 2FAs with Few Reversals ⋮ On the state complexity of operations on two-way finite automata ⋮ Oblivious two-way finite automata: decidability and complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the size of sweeping automata
- Converting two-way nondeterministic unary automata into simpler automata.
- Relationships between nondeterministic and deterministic tape complexities
- Two-Way Unary Automata versus Logarithmic Space
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
- Nondeterminism and the size of two way finite automata
- Some Results on Tape-Bounded Turing Machines
- Classes of languages and linear-bounded automata
This page was built for publication: Two-Way Automata versus Logarithmic Space
