Skip to Main content Skip to Navigation
Conference papers

Input-Driven Stack Automata

Abstract : We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible for moving the stack pointer up or down. While visibly pushdown languages share many desirable properties with regular languages, input-driven stack automata languages do not necessarily so. We prove that deterministic and nondeterministic input-driven stack automata have different computational power, which shows in passing that one cannot construct a deterministic input-driven stack automaton from a nondeterministic one. We study the computational capacity of these devices. Moreover, it is shown that the membership problem for nondeterministic input-driven stack automata languages is NP-complete.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, July 4, 2017 - 5:45:35 PM
Last modification on : Thursday, March 3, 2022 - 3:24:02 PM
Long-term archiving on: : Friday, December 15, 2017 - 1:34:20 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher. Input-Driven Stack Automata. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.28-42, ⟨10.1007/978-3-642-33475-7_3⟩. ⟨hal-01556210⟩



Record views


Files downloads