Translating recursion equations into flow charts

DOI10.1016/S0022-0000(71)80036-3MaRDI QIDQ2553232zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• scientific article; zbMATH DE number 3229496 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3066801 (Why is no real title available?)
• Counter machines and counter languages
• Gödel numberings of partial recursive functions
• Properties of Programs and the First-Order Predicate Calculus
• Recursion and iteration
• Unsolvability in 3 × 3 Matrices

Cited in

(14)

• scientific article; zbMATH DE number 3567992 (Why is no real title available?)
• Function iteration logics and flowchart schemata
• Feferman on computability
• On a class of recursive procedures and equivalent iterative ones
• Translatability of schemas over restricted interpretations
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
• A family of rules for recursion removal
• On self-modifying programs
• Recursive converters on a memory
• Program equivalence and context-free grammars
• The equivalence of r.e. program schemes and data flow schemes
• Program transformations and algebraic semantics
• Effective proper procedures and universal classes of program schemata
• Characterization of flowchartable recursions

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)