Pages that link to "Item:Q2553232"
From MaRDI portal
The following pages link to Translating recursion equations into flow charts (Q2553232):
Displayed 13 items.
- The equivalence of r.e. program schemes and data flow schemes (Q1144928) (← links)
- Program equivalence and context-free grammars (Q1221492) (← links)
- Function iteration logics and flowchart schemata (Q1226854) (← links)
- A family of rules for recursion removal (Q1233310) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← links)
- Program transformations and algebraic semantics (Q1254849) (← links)
- On a class of recursive procedures and equivalent iterative ones (Q1255777) (← links)
- Translatability of schemas over restricted interpretations (Q1844072) (← links)
- On self-modifying programs (Q1845615) (← links)
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259) (← links)
- Characterization of flowchartable recursions (Q2562565) (← links)
- Recursive converters on a memory (Q3885193) (← links)
- (Q4139645) (← links)