Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6881
Full metadata record
DC FieldValueLanguage
dc.creatorBeyer, Wendel Terry-
dc.date2004-10-20T20:04:08Z-
dc.date2004-10-20T20:04:08Z-
dc.date1969-10-01-
dc.date.accessioned2013-10-09T02:47:26Z-
dc.date.available2013-10-09T02:47:26Z-
dc.date.issued2013-10-09-
dc.identifierAITR-229-
dc.identifierhttp://hdl.handle.net/1721.1/6881-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionA study is made of the recognition and transformation of figures by iterative arrays of finite state automata. A figure is a finite rectangular two-dimensional array of symbols. The iterative arrays considered are also finite, rectangular, and two-dimensional. The automata comprising any given array are called cells and are assumed to be isomorphic and to operate synchronously with the state of a cell at time t+1 being a function of the states of it and its four nearest neighbors at time t. At time t=0 each cell is placed in one of a fixed number of initial states. The pattern of initial states thus introduced represents the figure to be processed. The resulting sequence of array states represents a computation based on the input figure. If one waits for a specially designated cell to indicate acceptance or rejection of the figure, the array is said to be working on a recognition problem. If one waits for the array to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem.-
dc.format8812626 bytes-
dc.format6046858 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAITR-229-
dc.titleRecognition of Topological Invariants by Iterative 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.