Translating recursion equations into flow charts
From MaRDI portal
Publication:2553232
DOI10.1016/S0022-0000(71)80036-3zbMATH Open0239.68002OpenAlexW2122330398MaRDI QIDQ2553232FDOQ2553232
Authors: H. R. jun. Strong 
Publication date: 1971
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(71)80036-3
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unsolvability in 3 × 3 Matrices
- Title not available (Why is that?)
- Counter machines and counter languages
- Title not available (Why is that?)
- Gödel numberings of partial recursive functions
- Properties of Programs and the First-Order Predicate Calculus
- Title not available (Why is that?)
- Recursion and iteration
Cited In (14)
- Effective proper procedures and universal classes of program schemata
- Translatability of schemas over restricted interpretations
- On a class of recursive procedures and equivalent iterative ones
- Characterization of flowchartable recursions
- Recursive converters on a memory
- The equivalence of r.e. program schemes and data flow schemes
- A family of rules for recursion removal
- Title not available (Why is that?)
- On self-modifying programs
- Program equivalence and context-free grammars
- Program transformations and algebraic semantics
- Feferman on Computability
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
- Function iteration logics and flowchart schemata
This page was built for publication: Translating recursion equations into flow charts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553232)
