Abstract

In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself. Although not every diagram is decomposable into a finite numbm of given base diagrams, this becomes hue at a semantical level due to a suitable extension of the given set and of the basic mappings defined in it. Two normalization methods of flow diagrams are given. The first has |hree base diagrams; the second, only two. In the second part of the paper, the second method is ap-plied to 'lhe theory of Turing machines. With every Turing maching provided with a two-way half-tape, ihere is associ-ated a similar machine, doing essentially 'lhe same job, but working on a tape obtained from the first one by interspersing alternate blank squares. The new machine belongs to the family, elsewhere introduced, generated by composition and iteration from the two machines X and R. That family is a proper subfamily of the whole family of Turing machines.

Citations

3	On the equivalence and transformation of program schemes - Ianov - 1958
2	Graphschemata und rekursive Funktionen - Péter - 1958
1	Specification languages for mechanical languages and their processors - Goas - 1961
1	Un'applicazione della teoria dei graft. Atli del Convegno Nazionale di Logica - CIAMPA - 1961
1	Programmation et th~orie des categories - RIGUET - 1962
1	Functional algorithms and graph schema - ASSER - 1961
1	On a family of Turing machines and the related programming language - BiJtfM - 1964
1	Nuove tecniche di progrummazione semplificanti la sintesi di macchine universuli di - BHM, JACOPINI - 1962