Transformation of program schrmes to standard forms
S. K. Basu · 1968
Program schemes are represented as directed, labeled graphs over some vocabulary. Such schemes are transformed to block form by obtaining a regular expression from the graph and translating it to block form by using a recursive correspondence. A necessary and sufficient condition is given for the transformed graph to be deterministic.