Generalizing Cook's transformation to imperative stack programs

DOI10.1007/3-540-58131-6_33zbMath1529.68077OpenAlexW2141081167WikidataQ108435901 ScholiaQ108435901MaRDI QIDQ6142866

No author found.

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• A note on linear time simulation of deterministic two-way pushdown automata
• Improving programs by the introduction of recursion
• Nondeterministic Algorithms
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalizing Cook's transformation to imperative stack programs