Related papers: On the Dynamical Behaviour of Cellular Automata
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
In line with the stability theory of continuous dynamical systems, Lyapunov exponents of cellular automata (CAs) have been conceived two decades ago to quantify to what extent their dynamics changes following a perturbation of their initial…
This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step.…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
In this work we provide analytic results of infinite one-dimensional cellular automaton(CA). By realizing symbolic products, we investigate a subclass of infinite CA and prove analytically that within this subclass the only allowed…
This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…
Continuous cellular automata (CCAs) have evolved from discrete lookup tables to continuous partial differential equation (PDE) formulations in the search for novel forms of complexity. Despite innovations in qualitative behavior, analytical…
Hierarchical structure is an essential part of complexity, important notion relevant for a wide range of applications ranging from biological population dynamics through robotics to social sciences. In this paper we propose a simple…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…
Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena. However, when using conventional computers, these 'simple' rules are only encapsulated at the…
We redefine the transition function of elementary cellular automata (ECA) in terms of discrete operators. The operator representation provides a clear hint about the way systems behave both at the local and the global scale. We show that…
This paper presents solutions to Density Classification Task (DCT) using a variant of Cellular Automata (CA) called Programmable Cellular Automata (PCA). The translation property as well as the density preserving property of fundamental CA…
Cellular automata on the triangular grid are here referred to as Triangular Automata (TA). This paper focuses on the simplest class of TA, called Elementary Triangular Automata (ETA). They are argued to be the two-dimensional counterpart of…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
We are interested in topological and ergodic properties of one dimensional cellular automata. We show that an ergodic cellular automaton cannot have irrational eigenvalues. We show that any cellular automaton with an equicontinuous factor…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…