Recognition of Topological Invariants by Iterative Arrays
A 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...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6881 |
| _version_ | 1826198580233240576 |
|---|---|
| author | Beyer, Wendel Terry |
| author_facet | Beyer, Wendel Terry |
| author_sort | Beyer, Wendel Terry |
| collection | MIT |
| description | A 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. |
| first_indexed | 2024-09-23T11:06:46Z |
| id | mit-1721.1/6881 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:06:46Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/68812019-04-12T08:32:45Z Recognition of Topological Invariants by Iterative Arrays Beyer, Wendel Terry A 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. 2004-10-20T20:04:08Z 2004-10-20T20:04:08Z 1969-10-01 AITR-229 http://hdl.handle.net/1721.1/6881 en_US AITR-229 8812626 bytes 6046858 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Beyer, Wendel Terry Recognition of Topological Invariants by Iterative Arrays |
| title | Recognition of Topological Invariants by Iterative Arrays |
| title_full | Recognition of Topological Invariants by Iterative Arrays |
| title_fullStr | Recognition of Topological Invariants by Iterative Arrays |
| title_full_unstemmed | Recognition of Topological Invariants by Iterative Arrays |
| title_short | Recognition of Topological Invariants by Iterative Arrays |
| title_sort | recognition of topological invariants by iterative arrays |
| url | http://hdl.handle.net/1721.1/6881 |
| work_keys_str_mv | AT beyerwendelterry recognitionoftopologicalinvariantsbyiterativearrays |