DMCA
Flow Diagrams, Turing Machines and Languages with only Two Formation Rules (1966)
| Venue: | Communications of the ACM |
| Citations: | 174 - 0 self |
BibTeX
@ARTICLE{Jacopini66flowdiagrams,,
author = {Giuseppe Jacopini},
title = {Flow Diagrams, Turing Machines and Languages with only Two Formation Rules},
journal = {Communications of the ACM},
year = {1966},
volume = {9},
pages = {366--371}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
Keyphrases
flow diagram turing machine formation rule second part second method first part suitable extension new machine belongs alternate blank square lhe theory normalization method basic mapping two-way half-tape proper subfamily base diagram similar machine inter ah mapping semantical level hree base diagram finite numbm whole family lhe job
