Modeling recursion with the aid of iterative algorithms

MaRDI QIDQ1097685zbMATH OpenFDO

Authors S. V. Safronyuk, Anatoly V. Anisimov

Publication date 1986

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

towers of Hanoitree traversaliterative representationmerge sortingrecursive nonlinear program scheme

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1092235
• Pour en finir avec la dérécursivation du problème des tours de Hanoï
• A new approach to recursion removal
• Towers of Hanoi problems: deriving iterative solutions by program transformations
• Recursion via Pascal

Cited in

(6)

• Application of a recursive method to the solution of problems of operator programming
• Recursion via Pascal
• Recursive information transducers: Computation models
• scientific article; zbMATH DE number 7434531 (Why is no real title available?)
• Simple Models for Recursive Schemes
• La fonction d'Ackermann : un nouveau mode de dérécursivation

This page was built for publication: Modeling recursion with the aid of iterative algorithms

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