Three-dimensional alternating Turing machines with only universal states
From MaRDI portal
Publication:1129412
DOI10.1016/S0020-0255(96)00124-7zbMath0899.03029MaRDI QIDQ1129412
Makoto Sakamoto, Katsushi Inoue
Publication date: 10 November 1998
Published in: Information Sciences (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Two-dimensional alternative Turing machines
- A note on three-way two dimensional alternating Turing machines
- Alternating multihead finite automata
- On alternation
- Three-way tape-bounded two-dimensional Turing machines
- Tree-size bounded alternation
- On alternation. II. A graph theoretic approach to determinism versus nondeterminism
- A note on deterministic three-way tape-bounded two-dimensional Turing machines
- A note on three-dimensional finite automata
- On tape-bounded complexity classes and multihead finite automata
- Some properties of two-dimensional on-line tessellation acceptors
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\)
- Two-dimensional alternating turing machines with only universal states
- Alternating Pushdown and Stack Automata
- Alternation
- (Semi)alternating stack automata
- Some Results on Tape-Bounded Turing Machines
This page was built for publication: Three-dimensional alternating Turing machines with only universal states
