The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1970 vol.19)
pp: 857-858
E.G. Wagner , IBM Corporation T. J. Watson Research Center
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.
INDEX TERMS
null
CITATION
E.G. Wagner, "R70-32 Tessellation Automata", IEEE Transactions on Computers, vol.19, no. 9, pp. 857-858, September 1970, doi:10.1109/T-C.1970.223060
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool