On the power of pushing or stationary moves for input-driven pushdown automata
From MaRDI portal
Publication:6131193
DOI10.1016/J.TCS.2024.114503OpenAlexW4392868567MaRDI QIDQ6131193FDOQ6131193
Matthias Wendlandt, Martin Kutrib, Andreas Malcher
Publication date: 4 April 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114503
deterministic pushdown automatainput-driven pushdown automatacomputational capacitydecidability questionsrepresentation by inverse homomorphism
Cites Work
- Title not available (Why is that?)
- Visibly pushdown languages
- Adding nesting structure to words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing Variants of Visibly Pushdown Automata
- Synchronization of Pushdown Automata
- Operator precedence and the visibly pushdown property
- On the power of pushing or stationary moves for input-driven pushdown automata
- Tinput-Driven Pushdown, Counter, and Stack Automata
- Digging input-driven pushdown automata
This page was built for publication: On the power of pushing or stationary moves for input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131193)
