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

C. Beeri*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

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.

Original languageEnglish
Pages (from-to)317-339
Number of pages23
JournalJournal of Computer and System Sciences
Volume10
Issue number3
DOIs
StatePublished - Jun 1975

Fingerprint

Dive into the research topics of 'Two-way nested stack automata are equivalent to two-way stack automata'. Together they form a unique fingerprint.

Cite this