Input-Driven Stack Automata
Authors:
Open Access
- 1 January 2012
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 28-42
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- State Complexity of Operations on Input-Driven Pushdown AutomataLecture Notes in Computer Science, 2011
- Operational state complexity of nested word automataTheoretical Computer Science, 2009
- Nondeterministic state complexity of nested word automataTheoretical Computer Science, 2009
- Adding nesting structure to wordsJournal of the ACM, 2009
- Minimizing Variants of Visibly Pushdown AutomataLecture Notes in Computer Science, 2007
- Input-driven languages are in log n depthInformation Processing Letters, 1988
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- On the complexity of finite, pushdown, and stack automataTheory of Computing Systems, 1976
- Checking stacks and context-free programmed grammars accept p-complete languages1974
- One-way stack automataJournal of the ACM, 1967