Automata on a 2-dimensional tape
Authors:
- M. BlumMBM. Blum
- C. HewittCHC. Hewitt
- 1 January 1967
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 155-160
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Linearly unrecognizable patterns1967
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The Reduction of Two-Way Automata to One-Way AutomataIBM Journal of Research and Development, 1959