Algebraic characterization of reducible flowcharts

摘要

Reducible flowcharts as introduced by Hecht and Ullman have been algebraically characterized by Elgot and Shepherdson. They showed them to be freely generated from elementary flowcharts by means of composition, sum, and scalar iteration. In this paper the algebraic characterization is extended to the class of infinite almost accessible reducible flowcharts.