8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)
Oct. 18, 1967 to Oct. 20, 1967
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1967.6
This paper explains our approach to the problem of pattern recognition by serial computer. The rudimentary theory of vision presented here lies within the framework of automata theory. Our goal is to classify the types of patterns that can be recognized by an automaton that scans a finite 2-dimensional tape. For example, we would like to know if an automaton can decide whether or not a given pattern on a tape forms a connected region. Although we have solved a number of problems, we have failed to solve this connectedness problem. This paper merely begins to describe the action of automata in higher dimensions. Our goal now is to generalize the theory presented here and make it applicable to a wide variety of pattern-recognizing machines.
M. Blum and C. Hewitt, "Automata on a 2-dimensional tape," 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS), Texas, 1967, pp. 155-160.