umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Input-Driven Stack Automata
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Institut für Informatik, Universität Giessen.
Institut für Informatik, Universität Giessen.
Institut für Informatik, Universität Giessen.
2012 (English)In: IFIP TCS: Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, 2012. Proceedings / [ed] Jos C. M. Baeten, Thomas Ball, and Frank S. de Boer, 2012, 28-42 p.Conference paper, Published paper (Refereed)
Abstract [en]

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 non- deterministic 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.

Place, publisher, year, edition, pages
2012. 28-42 p.
Series
Lecture Notes in Computer Science, 7604
National Category
Natural Sciences Computer and Information Science
Identifiers
URN: urn:nbn:se:umu:diva-60131ISBN: 978-3-642-33474-0 (print)OAI: oai:DiVA.org:umu-60131DiVA: diva2:558087
Conference
Theoretical Computer Science
Available from: 2012-10-01 Created: 2012-10-01 Last updated: 2013-06-13Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Bensch, Suna
By organisation
Department of Computing Science
Natural SciencesComputer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 147 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf