On 1-inkdot alternating Turing machines with small space
From MaRDI portal
Publication:1325841
DOI10.1016/0304-3975(94)90105-8zbMATH Open0805.68039OpenAlexW2046655488MaRDI QIDQ1325841FDOQ1325841
Authors: 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
Recommendations
- Some observations concerning alternating Turing machines using small space
- A note on multi-inkdot nondeterministic Turing machines with small space
- Alternating on-line Turing machines with only universal states and small space bounds
- Some properties of one-pebble Turing machines with sublogarithmic space
- Algorithms and Computation
Cites Work
- Alternation
- Title not available (Why is that?)
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
- On alternation
- Space bounded computations: Review and new separation results
- Tree-size bounded alternation
- Alternating on-line Turing machines with only universal states and small space bounds
- Some observations concerning alternating Turing machines using small space
- A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space
Cited In (5)
- A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines
- A note on multi-inkdot nondeterministic Turing machines with small space
- A relationship between nondeterministic turing machines and 1-inkdot turing machines with small space
- Some observations concerning alternating Turing machines using small space
- Alternation for sublogarithmic space-bounded alternating pushdown automata
This page was built for publication: On 1-inkdot alternating Turing machines with small space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325841)
