Automata On a 2-Dimensional Tape
| dc.date.accessioned | 2004-10-04T14:43:02Z | |
| dc.date.accessioned | 2018-11-24T10:12:05Z | |
| dc.date.available | 2004-10-04T14:43:02Z | |
| dc.date.available | 2018-11-24T10:12:05Z | |
| dc.date.issued | 1967-06-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6142 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6142 | |
| dc.description.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. Out 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. This paper should be viewed as a Progress Report on work done to date. Our goal now is to generalize the theory presented here and make it applicable to a wide variety of pattern-recognizing machines. | en_US |
| dc.format.extent | 12646715 bytes | |
| dc.format.extent | 525685 bytes | |
| dc.language.iso | en_US | |
| dc.title | Automata On a 2-Dimensional Tape | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-135.pdf | 525.6Kb | application/pdf | View/ |
| AIM-135.ps | 12.64Mb | application/postscript | View/ |