TY - JOUR
T1 - Two-way nested stack automata are equivalent to two-way stack automata
AU - Beeri, C.
PY - 1975/6
Y1 - 1975/6
N2 - The computing power of 2-way Nested Stack Automata is investigated. It is shownthat for any of the following types, a 2-way Nested Stack Automaton is equivalent to some 2-way Stack Automaton of the same type: Deterministic, Nondeterministic, k-head, L(n)-tape-bounded Auxiliary.
AB - The computing power of 2-way Nested Stack Automata is investigated. It is shownthat for any of the following types, a 2-way Nested Stack Automaton is equivalent to some 2-way Stack Automaton of the same type: Deterministic, Nondeterministic, k-head, L(n)-tape-bounded Auxiliary.
UR - http://www.scopus.com/inward/record.url?scp=0016518166&partnerID=8YFLogxK
U2 - 10.1016/S0022-0000(75)80004-3
DO - 10.1016/S0022-0000(75)80004-3
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0016518166
SN - 0022-0000
VL - 10
SP - 317
EP - 339
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 3
ER -