Given a flowchart with a single entrance and a single exit, it is easy to write down the recursive function that gives the transformation of the state vector from entrance to exit in terms of the corresponding functions for the computation blocks and the predicates of the branch points. In general, we proceed as follows.
No takes yet. Share an insight, caveat, or question.
Perlis et al. (1960) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: