The paper investigates the relationship between the classification schemes, defined by Wolfram and Gilman, of one-dimensional cellular automata through concepts coming from network theory. An automaton is represented with a network, generated from the elementary rule defining its behavior. Characteristic features of this graph are computed and machine learning classification models are built. Such models allow to classify automaton rules and to compare Wolfram’s and Gilman’s classes by comparing the classes predicted by these models.
REFERENCES
1.
J.
von Neumann
, Theory of Self-Reproducing Automata
(University of Illinois Press
, Champaign, IL, USA
, 1966
).2.
3.
R. H.
Gilman
, Ergodic Theory and Dynamical Systems
7
, 105
–118
(1987
).4.
Y.
Kayama
, “Network representation of cellular automata
,” in IEEE Symposium on Artificial Life, ALIFE 2011
, Paris, France
, April 13-15, 2011
(2011
), pp. 194
–202
.5.
P.-N.
Tan
, M.
Steinbach
, and V.
Kumar
, Introduction to Data Mining
(Addison-Wesley Longman Publishing Co., Inc.
, Boston, MA, USA
, 2005
).6.
7.
R.
Albert
and A.-L.
Barabási
, Review of Modern Physics
74
, 47
–97
(2002
).
This content is only available via PDF.
© 2016 Author(s).
2016
Author(s)
You do not currently have access to this content.
