Sweeping input-driven pushdown automata
From MaRDI portal
Publication:6199874
DOI10.1007/978-3-031-40247-0_14OpenAlexW4385710996MaRDI QIDQ6199874FDOQ6199874
Authors: Martin Kutrib 
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
- Two-way pushdown automata
- Visibly pushdown languages
- Adding nesting structure to words
- Growing context-sensitive languages and Church-Rosser languages
- Time and tape complexity of pushdown automaton languages
- Ordered multi-stack visibly pushdown automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Membership for growing context-sensitive grammars is polynomial
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- On the Tape Complexity of Deterministic Context-Free Languages
- Minimizing Variants of Visibly Pushdown Automata
- Scope-bounded pushdown languages
- On the complexity of formal grammars
- Time-bounded grammars and their languages
- Title not available (Why is that?)
- Tight lower bounds on the size of sweeping automata
- Synchronization of Pushdown Automata
- Operator precedence and the visibly pushdown property
- A simulation result for the auxiliary pushdown automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Input-driven stack automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Digging input-driven pushdown automata
- Two-way visibly pushdown automata and transducers
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)
