Show simple item record

Recognition of Topological Invariants by Modular Arrays

dc.date.accessioned2004-10-04T14:43:58Z
dc.date.accessioned2018-11-24T10:12:14Z
dc.date.available2004-10-04T14:43:58Z
dc.date.available2018-11-24T10:12:14Z
dc.date.issued1968-09-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6169
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6169
dc.description.abstractIn 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.en_US
dc.format.extent7489364 bytes
dc.format.extent539367 bytes
dc.language.isoen_US
dc.titleRecognition of Topological Invariants by Modular Arraysen_US


Files in this item

FilesSizeFormatView
AIM-166.pdf539.3Kbapplication/pdfView/Open
AIM-166.ps7.489Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record