Topological Conjugacy Classification of Cellular Automata

Author(s):  
Junbiao Guan ◽  
Shaowei Shen
2017 ◽  
Vol 27 (14) ◽  
pp. 1750217 ◽  
Author(s):  
Haiyun Xu ◽  
Fangyue Chen ◽  
Weifeng Jin

The topological conjugacy classification of elementary cellular automata with majority memory (ECAMs) is studied under the framework of symbolic dynamics. In the light of the conventional symbolic sequence space, the compact symbolic vector space is identified with a feasible metric and topology. A slight change is introduced to present that all global maps of ECAMs are continuous functions, thereafter generating the compact dynamical systems. By exploiting two fundamental homeomorphisms in symbolic vector space, all ECAMs are furthermore grouped into 88 equivalence classes in the sense that different mappings in the same global equivalence are mutually topologically conjugate.


2021 ◽  
Vol 29 (6) ◽  
pp. 835-850
Author(s):  
Vladislav Kruglov ◽  
◽  
Olga Pochinka ◽  
◽  

Purpose. The purpose of this study is to consider the class of Morse – Smale flows on surfaces, to characterize its subclass consisting of flows with a finite number of moduli of stability, and to obtain a topological classification of such flows up to topological conjugacy, that is, to find an invariant that shows that there exists a homeomorphism that transfers the trajectories of one flow to the trajectories of another while preserving the direction of movement and the time of movement along the trajectories; for the obtained invariant, to construct a polynomial algorithm for recognizing its isomorphism and to construct the realisation of the invariant by a standard flow on the surface. Methods. Methods for finding moduli of topological conjugacy go back to the classical works of J. Palis, W. di Melo and use smooth flow lianerization in a neighborhood of equilibrium states and limit cycles. For the classification of flows, the traditional methods of dividing the phase surface into regions with the same behavior of trajectories are used, which are a modification of the methods of A. A. Andronov, E. A. Leontovich, and A. G. Mayer. Results. It is shown that a Morse – Smale flow on a surface has a finite number of moduli if and only if it does not have a trajectory going from one limit cycle to another. For a subclass of Morse – Smale flows with a finite number of moduli, a classification is done up to topological conjugacy by means of an equipped graph. Conclusion. The criterion for the finiteness of the number of moduli of Morse – Smale flows on surfaces is obtained. A topological invariant is constructed that describes the topological conjugacy class of a Morse – Smale flow on a surface with a finite number of modules, that is, without trajectories going from one limit cycle to another.


2008 ◽  
Vol 19 (04) ◽  
pp. 557-567 ◽  
Author(s):  
ANDREW ADAMATZKY ◽  
LARRY BULL ◽  
PIERRE COLLET ◽  
EMMANUEL SAPIN

We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e., how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules are required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.


2019 ◽  
Vol 8 (4) ◽  
pp. 41-61
Author(s):  
Marcelo Arbori Nogueira ◽  
Pedro Paulo Balbi de Oliveira

Cellular automata present great variability in their temporal evolutions due to the number of rules and initial configurations. The possibility of automatically classifying its dynamic behavior would be of great value when studying properties of its dynamics. By counting on elementary cellular automata, and considering its temporal evolution as binary images, the authors created a texture descriptor of the images - based on the neighborhood configurations of the cells in temporal evolutions - so that it could be associated to each dynamic behavior class, following the scheme of Wolfram's classic classification. It was then possible to predict the class of rules of a temporal evolution of an elementary rule in a more effective way than others in the literature in terms of precision and computational cost. By applying the classifier to the larger neighborhood space containing 4 cells, accuracy decreased to just over 70%. However, the classifier is still able to provide some information about the dynamics of an unknown larger space with reduced computational cost.


2010 ◽  
Vol 104 (1-2) ◽  
pp. 125-140
Author(s):  
Hidenosuke Nishio
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document