DocumentCode :
1106105
Title :
R70-32 Tessellation Automata
Author :
Wagner, E.G.
Issue :
9
fYear :
1970
Firstpage :
857
Lastpage :
858
Abstract :
In the last fifteen years many researchers working in such diverse areas as pattern recognition, parallel computation, self-reproducing automata, pattern recognition, evolution theory, information retrieval, and integrated circuit technology have found it convenient to use an array of identical intercommunicating finite-state machines as their underlying model. This naturally suggests that it would be worthwhile to develop a comprehensive theory of such arrays which would then provide a common framework for all these areas. Yamada and Amoroso have taken up this suggestion, and this paper is the first in a proposed series of papers reporting their results. However, as they readily admit, they have not attempted to produce a truly comprehensive model (an ill-defined, if not impossible, task), but rather they have been concerned with a "fairly general" model based largely on the earlier work of Moore.
Keywords :
Automata; Concurrent computing; Information retrieval; Integrated circuit modeling; Integrated circuit technology; Lamination; Lattices; Pattern recognition; Proposals;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1970.223060
Filename :
1671653
Link To Document :
بازگشت