Two-way nested stack automata are equivalent to two-way stack automata
作者：
Highlights：
•
摘要
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.
论文关键词：
论文评审过程：Received 8 December 1973, Available online 27 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(75)80004-3
