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

DOI10.1007/978-3-031-07469-1_11MaRDI QIDQ2164744zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher, Matthias Wendlandt

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-07469-1_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Adding nesting structure to words
• Digging input-driven pushdown automata
• scientific article; zbMATH DE number 3885334 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• Input-Driven Pushdown Automata with Limited Nondeterminism
• Minimizing Variants of Visibly Pushdown Automata
• Operator precedence and the visibly pushdown property
• Synchronization of Pushdown Automata
• Tinput-driven pushdown, counter, and stack automata
• Visibly pushdown languages

Cited in

(3)

• On the power of pushing or stationary moves for input-driven pushdown automata
• Sweeping input-driven pushdown automata
• Sweeping 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 Q2164744)