The Complexity of Finite Memory Programs with Recursion
From MaRDI portal
Publication:4147590
DOI10.1145/322063.322074zbMath0371.68017OpenAlexW2018379587WikidataQ129165360 ScholiaQ129165360MaRDI QIDQ4147590
Neil D. Jones, Steven S. Muchnick
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322063.322074
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items (4)
An approach to deciding the observational equivalence of Algol-like languages ⋮ An observationally complete program logic for imperative higher-order functions ⋮ Complexity of proving program correctness ⋮ Some simplified undecidable and NP-hard problems for simple programs
This page was built for publication: The Complexity of Finite Memory Programs with Recursion