Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6142Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Blum, M. | - |
| dc.creator | Hewitt, C. | - |
| dc.date | 2004-10-04T14:43:02Z | - |
| dc.date | 2004-10-04T14:43:02Z | - |
| dc.date | 1967-06-01 | - |
| dc.date.accessioned | 2013-10-09T02:43:17Z | - |
| dc.date.available | 2013-10-09T02:43:17Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-135 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6142 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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. | - |
| dc.format | 12646715 bytes | - |
| dc.format | 525685 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-135 | - |
| dc.title | Automata On a 2-Dimensional Tape | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.