Translating recursion equations into flow charts

45Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes the foundation for a systematic study of the translation of recursive function definitions into flow charts (often called the removal of recursions). Several notions of translation are presented. Emphasis is placed on translation which could be performed mechanically, operating only on the syntactic structure of the recursion equations. Systems of recursion equations are classified by structure and by the dynamics of their implicit computations. A theorem concerned with the relation between iterative form recursion equations and flow charts completes Part I. In Part II a class of systems of recursion equations which are not translatable is exhibited. A restrictive notion of translatability, motivated by a desire for efficient programs as translations, is characterized for a wide (decidable) class. Translation algorithms are presented. © 1971 Academic Press, Inc.

Cite

CITATION STYLE

APA

Strong, H. R. (1971). Translating recursion equations into flow charts. Journal of Computer and System Sciences, 5(3), 254–285. https://doi.org/10.1016/S0022-0000(71)80036-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free