Sweeping input-driven pushdown automata
From MaRDI portal
Publication:6199874
DOI10.1007/978-3-031-40247-0_14OpenAlexW4385710996MaRDI QIDQ6199874
Publication date: 28 February 2024
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_14
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered multi-stack visibly pushdown automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Membership for growing context-sensitive grammars is polynomial
- A simulation result for the auxiliary pushdown automata
- On the complexity of formal grammars
- Growing context-sensitive languages and Church-Rosser languages
- Tight lower bounds on the size of sweeping automata
- Operator precedence and the visibly pushdown property
- On the power of pushing or stationary moves for input-driven pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Time-bounded grammars and their languages
- Input-Driven Stack Automata
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Adding nesting structure to words
- Minimizing Variants of Visibly Pushdown Automata
- Visibly pushdown languages
- Synchronization of Pushdown Automata
- On the Tape Complexity of Deterministic Context-Free Languages
- Two-Way Visibly Pushdown Automata and Transducers
- Digging input-driven pushdown automata
- Two-way pushdown automata
- Time and tape complexity of pushdown automaton languages
- Scope-Bounded Pushdown Languages
This page was built for publication: Sweeping input-driven pushdown automata
