A note on alternating on-line Turing machines

DOI10.1016/0020-0190(82)90098-9zbMath0532.68054OpenAlexW1993779423MaRDI QIDQ789181

Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90098-9

zbMATH Keywords

parallel computationalternationon-line Turing machines

Mathematics Subject Classification ID

Related Items

Alternating on-line Turing machines with only universal states and small space bounds, Constructions for alternating finite automata^∗, A leaf-time hierarchy of two-dimensional alternating turing machines

Cites Work

• Unnamed Item
• Unnamed Item
• On alternation
• Tree-size bounded alternation
• On alternation. II. A graph theoretic approach to determinism versus nondeterminism
• Alternation
• Some Results on Tape-Bounded Turing Machines