ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
From MaRDI portal
Publication:4020282
DOI10.1142/S0129054192000073zbMath0769.68030MaRDI QIDQ4020282
Anna Slobodová, Itsuo Takanami, Juraj Hromkovič, Branislav Rovan, Katsushi Inoue, Klaus W. Wagner
Publication date: 16 January 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
context-sensitive languagessynchronized alternationmultihead finite automatasynchronization complexityone-way synchronized alternating finite automataone-way synchronized Turing machines
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Deterministic versus nondeterministic space in terms of synchronized alternating machines ⋮ On communication-bounded synchronized alternating finite automata ⋮ A communication hierarchy of parallel computations ⋮ Communication for alternating machines ⋮ A note on realtime one-way synchronized alternating one-counter automata ⋮ Alternating finite automata and star-free languages
This page was built for publication: ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
