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

C. Beeri

doi:10.1016/S0022-0000(75)80004-3

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

C. Beeri^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	317-339
Number of pages	23
Journal	Journal of Computer and System Sciences
Volume	10
Issue number	3
DOIs	https://doi.org/10.1016/S0022-0000(75)80004-3
State	Published - Jun 1975

Access to Document

10.1016/S0022-0000(75)80004-3

Cite this

@article{a4bdc7781dcc4aad876dd2a36eb10ea0,

title = "Two-way nested stack automata are equivalent to two-way stack automata",

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.",

author = "C. Beeri",

year = "1975",

month = jun,

doi = "10.1016/S0022-0000(75)80004-3",

language = "אנגלית",

volume = "10",

pages = "317--339",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}

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 - https://www.scopus.com/pages/publications/0016518166

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 -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this