Characterization of flowchartable recursions

DOI10.1016/S0022-0000(73)80032-7MaRDI QIDQ2562565zbMATH OpenFDO

Authors Yanyan Li

Publication date 1973

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(73)80032-7

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3558923 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• On formalised computer programs
• Translating recursion equations into flow charts
• Unsolvability in 3 × 3 Matrices

Cited in

(9)

• Towers of Hanoi problems: deriving iterative solutions by program transformations
• Deriving graphs from graphs by applying a production
• Program equivalence and context-free grammars
• 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
• scientific article; zbMATH DE number 3896271 (Why is no real title available?)
• On jump-deterministic pushdown automata
• scientific article; zbMATH DE number 7453187 (Why is no real title available?)

This page was built for publication: Characterization of flowchartable recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562565)