Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6169Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Beyer, Terry | - |
| dc.date | 2004-10-04T14:43:58Z | - |
| dc.date | 2004-10-04T14:43:58Z | - |
| dc.date | 1968-09-01 | - |
| dc.date.accessioned | 2013-10-09T02:43:43Z | - |
| dc.date.available | 2013-10-09T02:43:43Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-166 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6169 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | In this paper we study recognition of topological invariant properties of patterns by use of finite, rectangular 2-dimensional, interactive arrays of finite state automata (hereafter called modular arrays). The use of modular arrays as pattern recognition devices has been studied by Atrubin [1] and by Unger [2]. Our aim is to show that modular arrays can not only recognize a large variety of topological invariants, but can do so in times that are almost minimal for a certain class of machines. We begin by describing our model of the modular array as a pattern recognition connectivity. Next, we introduce a fundamental transformation of patterns and prove several interesting properties of the transformation. Finally, we apply the transformation to modular arrays to obtain fast methods of recognizing a wide variety of topological invariants. | - |
| dc.format | 7489364 bytes | - |
| dc.format | 539367 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-166 | - |
| dc.title | Recognition of Topological Invariants by Modular Arrays | - |
| 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.