Sweeping input-driven pushdown automata
From MaRDI portal
Publication:6199874
Cites work
- scientific article; zbMATH DE number 3885334 (Why is no real title available?)
- scientific article; zbMATH DE number 3696500 (Why is no real title available?)
- scientific article; zbMATH DE number 3230262 (Why is no real title available?)
- A simulation result for the auxiliary pushdown automata
- Adding nesting structure to words
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Digging input-driven pushdown automata
- Growing context-sensitive languages and Church-Rosser languages
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Input-driven stack automata
- Membership for growing context-sensitive grammars is polynomial
- Minimizing Variants of Visibly Pushdown Automata
- On the Tape Complexity of Deterministic Context-Free Languages
- On the complexity of formal grammars
- On the power of pushing or stationary moves for input-driven pushdown automata
- Operator precedence and the visibly pushdown property
- Ordered multi-stack visibly pushdown automata
- Scope-bounded pushdown languages
- Synchronization of Pushdown Automata
- Tight lower bounds on the size of sweeping automata
- Time and tape complexity of pushdown automaton languages
- Time-bounded grammars and their languages
- Two-way pushdown automata
- Two-way visibly pushdown automata and transducers
- Visibly pushdown languages
This page was built for publication: Sweeping input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199874)
