Two-way nested stack automata are equivalent to two-way stack automata

Authors:
C. Beeri
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1975

Citing 4
Cited 1

Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Nested Stack Automata

Journal of the ACM (JACM)
Halting Stack Automata

Journal of the ACM (JACM)
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

Nodes connected by path languages

DLT'11 Proceedings of the 15th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.