On the power of pushing or stationary moves for input-driven pushdown automata

DOI10.1016/j.tcs.2024.114503OpenAlexW4392868567MaRDI QIDQ6131193

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

zbMATH Keywords

deterministic pushdown automatainput-driven pushdown automatacomputational capacitydecidability questionsrepresentation by inverse homomorphism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Operator precedence and the visibly pushdown property
• On the power of pushing or stationary moves for input-driven pushdown automata
• Adding nesting structure to words
• Minimizing Variants of Visibly Pushdown Automata
• Visibly pushdown languages
• Synchronization of 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