Variations on pushdown machines (Detailed Abstract)

DOI10.1145/800169.805437MaRDI QIDQ5402522zbMATH OpenOpenAlexFDO

Authors Stephen Cook

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800169.805437

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2038700
• A Note on Pushdown Automata Systems
• Recursive schemes, Krivine machines, and collapsible pushdown automata
• Equivalence of deterministic pushdown automata revisited
• On pure multi-pushdown automata that perform complete pushdown pops
• On the power of bounded concurrency II
• A note on bounded-reversal multipushdown machines
• Pushdown automata and constant height: decidability and bounds
• Pushdown automata and constant height: decidability and bounds
• scientific article; zbMATH DE number 4047168

Cited in

(13)

• Some modifications of auxiliary pushdown automata
• Pushdown Permuter Characterization Theorem
• Pushdown store machines and real-time computation
• Writing stack acceptors
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• scientific article; zbMATH DE number 176163 (Why is no real title available?)
• scientific article; zbMATH DE number 4092805 (Why is no real title available?)
• Extended macro grammars and stack controlled machines
• Alternating Pushdown and Stack Automata
• Time- and tape-bounded Turing acceptors and AFLs
• Efficient pushdown cellular automata: universality, time and space hierarchies
• Time varying pushdown automata
• scientific article; zbMATH DE number 3976383 (Why is no real title available?)

This page was built for publication: Variations on pushdown machines (Detailed Abstract)

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