Graph theoretic characterization of G-schemes and T L-schemes

AbstractThe G-schemes are a class of structured flowchart schemes defined algebraically by Elgot in [1]. Bloom and Tindell [2] gave a graph theoretic characterization of the biaccessible G-schemes, i.e. those in which every vertex is on a path from begin to exit. We give here a graph theoretic characterization of the entire class of G-schemes, and also of a smaller and simpler class, the T L-schemes of [5]