The subclass of 2D cellular automata with one graph of connections

• Autorzy: Porębska, A.
• Języki publikacji: EN

Abstrakty

EN

We describe how the rules for binary two-dimensional cellular automata with von Neumann neighborhood can be created depending on the appropriate graphs of connections. Those graphs are closely connected with configurations for which the new state of automaton cell stays one. We describe the group of rules created for the chosen symmetric graph which is the same for a few groups of configurations. We analyze how they influence the behavior of cellular automata. We observed that almost all cellular automata with one symmetric graph process the input signal in similar way. Thanks to that, in the analyses of other such subclasses of cellular automata (with other symmetric graphs of connections) we can limit ourselves to the examination of the final state achieved by only one cellular automaton with representing this group rule. It lets us make the process of searching cellular automata with the complex behavior easier.

Słowa kluczowe

PL

automat komórkowy; 2D; wykres połączeń

EN

cellular automata; 2D; graph of connections

• Czasopismo: Poznan University of Technology Academic Journals. Electrical Engineering
• Rocznik: 2011
• Tom: No. 66
• Strony: 145--154
• Opis fizyczny: Bibluiogr. 7 poz., rys.

Twórcy

autor

Porębska, A.

• AGH University of Science and Technology

Bibliografia

• [1] Wolfram, S.: Theory and Applications of Cellular Automata, Singapore, World Scientific Publishing Co Pte Ltd, 1986.
• [2] Li, W., Packard, N. H., Langton, C. G.: Transition Phenomena in Cellular Automata Rule Space, Physica D 45, 1990, pp. 77-94.
• [3] Durand, B., Formenti, E., Varouchas, G.: On undecidability of equicontinuity classification for cellular automata, Discrete Mathematics and Theoretical Computer Science AB, 2003, pp. 117-128.
• [4] de O1iveira, G.M.B., Siqueira, S.R.C.: Parameter characterisation of two-dimensional cellular automata rule space. Physica D 217, 2006, pp. 1-6.
• [5] Wolz, D., de O1iveira, P.P.B.: Very effective evolutionary techniques for searching cellular automata rule spaces, Journal of Cellular Automata 3(4), 2008, pp. 289-312.
• [6] Makowiec, D.: Remarks on the Rule Classification of Symmetric Two-Dimensional Homogeneous Cellular Automata, Physica A 176, 1991, pp. 430-446.
• [7] Porębska, A.: Searching the Space of 2D Cellular Automata Basing on the Analysis of the Graphs of Connections for the Neighboring Cells, In: ZKwE'09 : Transactions on Computer Applications in Electrical Engineering, Poznan Technical University Press, Poznan, 2009, pp. 295-296.