Pushdown automata

MaRDI QIDQ4662826zbMATH OpenFDO

Authors Hendrik Jan Hoogeboom, Joost Engelfriet

Publication date 30 March 2005

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Decidability of the equivalence problem for deterministic pushdown automata
• scientific article; zbMATH DE number 4771
• Equivalence of deterministic pushdown automata revisited
• Context-Dependent Nondeterminism for Pushdown Automata
• Context-dependent nondeterminism for pushdown automata

Cited in

(20)

• Pushdown automata with reversal-bounded counters
• Periodic properties of pushdown automata
• Computation with multiple CTCs of fixed length and width
• Piecewise directable automata
• Blackhole pushdown automata
• Tinput-Driven Pushdown Automata
• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
• Red–Green P Automata
• Height-Deterministic Pushdown Automata
• scientific article; zbMATH DE number 4771 (Why is no real title available?)
• Postfix automata
• scientific article; zbMATH DE number 7439739 (Why is no real title available?)
• scientific article; zbMATH DE number 5593273 (Why is no real title available?)
• Membrane Computing
• A note on multidimensional Dyck languages
• A Note on Pushdown Automata Systems
• Look-ahead on pushdowns
• Rediscovering pushdown machines
• Grammar semantics, analysis and parsing by abstract interpretation
• On groups whose cogrowth series is the diagonal of a rational series

This page was built for publication: Pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4662826)