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 array...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Project MAC, Mass. Inst. of Technology
1969
|
| Schlagworte: | |
| Zusammenfassung: | 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 arrays to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem. In addition to the formal results, several open questions are presented and some iterative programming techniques are considered. (Author). |
| Beschreibung: | Kopie, erschienen bei National Techn. Information Service, Springfield, Va. |
| Beschreibung: | 143 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879345 | ||
| 003 | DE-604 | ||
| 005 | 20240719 | ||
| 007 | t | ||
| 008 | 880721s1969 m||| 00||| eng d | ||
| 035 | |a (OCoLC)227570567 | ||
| 035 | |a (DE-599)BVBBV021879345 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MAC-TR-66 | ||
| 100 | 1 | |a Beyer, Wendell T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recognition of topological invariants by iterative arrays |c Wendell Terry Beyer |
| 264 | 1 | |a Cambridge, Mass. |b Project MAC, Mass. Inst. of Technology |c 1969 | |
| 300 | |a 143 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Kopie, erschienen bei National Techn. Information Service, Springfield, Va. | ||
| 502 | |a Zugl.: Diss. | ||
| 520 | 3 | |a 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 arrays to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem. In addition to the formal results, several open questions are presented and some iterative programming techniques are considered. (Author). | |
| 650 | 7 | |a (Pattern recognition |2 dtict | |
| 650 | 7 | |a Automata) |2 dtict | |
| 650 | 7 | |a Bionics |2 scgdst | |
| 650 | 7 | |a Computer Systems |2 scgdst | |
| 650 | 7 | |a Cybernetics |2 scgdst | |
| 650 | 7 | |a Real time |2 dtict | |
| 650 | 7 | |a Symbols |2 dtict | |
| 650 | 7 | |a Theses |2 dtict | |
| 650 | 7 | |a Time sharing |2 dtict | |
| 650 | 7 | |a Transformations |2 dtict | |
| 650 | 0 | 7 | |a Iteration |0 (DE-588)4123457-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Invarianz |0 (DE-588)4120518-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mustererkennung |0 (DE-588)4040936-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Mustererkennung |0 (DE-588)4040936-3 |D s |
| 689 | 0 | 1 | |a Invarianz |0 (DE-588)4120518-2 |D s |
| 689 | 0 | 2 | |a Iteration |0 (DE-588)4123457-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015094827 | |
Datensatz im Suchindex
| _version_ | 1805088320807501824 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Beyer, Wendell T. |
| author_facet | Beyer, Wendell T. |
| author_role | aut |
| author_sort | Beyer, Wendell T. |
| author_variant | w t b wt wtb |
| building | Verbundindex |
| bvnumber | BV021879345 |
| ctrlnum | (OCoLC)227570567 (DE-599)BVBBV021879345 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV021879345</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240719</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880721s1969 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227570567</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879345</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MAC-TR-66</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beyer, Wendell T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recognition of topological invariants by iterative arrays</subfield><subfield code="c">Wendell Terry Beyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Project MAC, Mass. Inst. of Technology</subfield><subfield code="c">1969</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">143 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Kopie, erschienen bei National Techn. Information Service, Springfield, Va.</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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 arrays to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem. In addition to the formal results, several open questions are presented and some iterative programming techniques are considered. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">(Pattern recognition</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automata)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Systems</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cybernetics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Real time</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Symbols</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Time sharing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Transformations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Invarianz</subfield><subfield code="0">(DE-588)4120518-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mustererkennung</subfield><subfield code="0">(DE-588)4040936-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mustererkennung</subfield><subfield code="0">(DE-588)4040936-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Invarianz</subfield><subfield code="0">(DE-588)4120518-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Iteration</subfield><subfield code="0">(DE-588)4123457-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015094827</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV021879345 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:42Z |
| indexdate | 2024-07-20T09:06:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015094827 |
| oclc_num | 227570567 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 143 S. |
| publishDate | 1969 |
| publishDateSearch | 1969 |
| publishDateSort | 1969 |
| publisher | Project MAC, Mass. Inst. of Technology |
| record_format | marc |
| spelling | Beyer, Wendell T. Verfasser aut Recognition of topological invariants by iterative arrays Wendell Terry Beyer Cambridge, Mass. Project MAC, Mass. Inst. of Technology 1969 143 S. txt rdacontent n rdamedia nc rdacarrier Kopie, erschienen bei National Techn. Information Service, Springfield, Va. Zugl.: Diss. 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 arrays to come to a stable configuration representing an output figure, the array is said to be working on a transformation problem. In addition to the formal results, several open questions are presented and some iterative programming techniques are considered. (Author). (Pattern recognition dtict Automata) dtict Bionics scgdst Computer Systems scgdst Cybernetics scgdst Real time dtict Symbols dtict Theses dtict Time sharing dtict Transformations dtict Iteration (DE-588)4123457-1 gnd rswk-swf Invarianz (DE-588)4120518-2 gnd rswk-swf Mustererkennung (DE-588)4040936-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Mustererkennung (DE-588)4040936-3 s Invarianz (DE-588)4120518-2 s Iteration (DE-588)4123457-1 s DE-604 |
| spellingShingle | Beyer, Wendell T. Recognition of topological invariants by iterative arrays (Pattern recognition dtict Automata) dtict Bionics scgdst Computer Systems scgdst Cybernetics scgdst Real time dtict Symbols dtict Theses dtict Time sharing dtict Transformations dtict Iteration (DE-588)4123457-1 gnd Invarianz (DE-588)4120518-2 gnd Mustererkennung (DE-588)4040936-3 gnd |
| subject_GND | (DE-588)4123457-1 (DE-588)4120518-2 (DE-588)4040936-3 (DE-588)4113937-9 |
| title | Recognition of topological invariants by iterative arrays |
| title_auth | Recognition of topological invariants by iterative arrays |
| title_exact_search | Recognition of topological invariants by iterative arrays |
| title_exact_search_txtP | Recognition of topological invariants by iterative arrays |
| title_full | Recognition of topological invariants by iterative arrays Wendell Terry Beyer |
| title_fullStr | Recognition of topological invariants by iterative arrays Wendell Terry Beyer |
| title_full_unstemmed | Recognition of topological invariants by iterative arrays Wendell Terry Beyer |
| title_short | Recognition of topological invariants by iterative arrays |
| title_sort | recognition of topological invariants by iterative arrays |
| topic | (Pattern recognition dtict Automata) dtict Bionics scgdst Computer Systems scgdst Cybernetics scgdst Real time dtict Symbols dtict Theses dtict Time sharing dtict Transformations dtict Iteration (DE-588)4123457-1 gnd Invarianz (DE-588)4120518-2 gnd Mustererkennung (DE-588)4040936-3 gnd |
| topic_facet | (Pattern recognition Automata) Bionics Computer Systems Cybernetics Real time Symbols Theses Time sharing Transformations Iteration Invarianz Mustererkennung Hochschulschrift |
| work_keys_str_mv | AT beyerwendellt recognitionoftopologicalinvariantsbyiterativearrays |