Characterization of flowchartable recursions

DOI10.1016/S0022-0000(73)80032-7zbMath0266.68011MaRDI QIDQ2562565

Yanyan Li

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items

Unnamed Item, Unnamed Item, Deriving graphs from graphs by applying a production, Program equivalence and context-free grammars, On jump-deterministic pushdown automata, Storage requirements for deterministic polynomial time recognizable languages, Output driven interpretation of recursive programs, or writing creates and destroys data structures, On a class of recursive procedures and equivalent iterative ones, Towers of Hanoi problems: deriving iterative solutions by program transformations

Cites Work

• On formalised computer programs
• Translating recursion equations into flow charts
• Unsolvability in 3 × 3 Matrices
• Unnamed Item
• Unnamed Item