On 1-inkdot alternating Turing machines with small space
From MaRDI portal
Publication:1325841
DOI10.1016/0304-3975(94)90105-8zbMath0805.68039OpenAlexW2046655488MaRDI QIDQ1325841
Katsushi Inoue, Akira Ito, Itsuo Takanami
Publication date: 22 June 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90105-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A note on multi-inkdot nondeterministic Turing machines with small space ⋮ Alternation for sublogarithmic space-bounded alternating pushdown automata
Cites Work
- Unnamed Item
- Alternating on-line Turing machines with only universal states and small space bounds
- Some observations concerning alternating Turing machines using small space
- On alternation
- Tree-size bounded alternation
- Space bounded computations: Review and new separation results
- A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space
- Alternation
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
This page was built for publication: On 1-inkdot alternating Turing machines with small space