Nonlinear Sciences

We systematically compute the power spectra of the one-dimensional elementary cellular automata introduced by Wolfram. On the one hand our analysis reveals that one automaton displays 1/f spectra though considered as trivial, and on the other hand that various automata classified as chaotic/complex display no 1/f spectra. We model the results generalizing the recently investigated Sierpinski signal to a class of fractal signals that are tailored to produce 1/ f α spectra. From the widespread occurrence of (elementary) cellular automata patterns in chemistry, physics and computer sciences, there are various candidates to show spectra similar to our results.

We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction problems, we developed 2-states and 3-states hexagonal growing algorithms that reach large populations through random initial states. Unlike the game of life, we used six neighbourhoods cellular automata instead of eight or four neighbourhoods. First simulations explained that whether we are able to obtain sort of oscillators, blinkers, and gliders. Inspired by Wolfram's 1D cellular automata complexity and life-like structures, we simulated 2D synchronous, discrete, deterministic cellular automata to reach life-like forms with 2-states cells. The life-like formations and the oscillators have been explained how they contribute to initiating self-maintenance together with self-reproduction and self-replication. After comparing the simulation results, we decided to develop the algorithm for another step. Appending a new state to the same algorithm, that we used for reaching life-like structures, led us to experiment new branching and fractal forms. All these studies tried to demonstrate that complex life forms might come from uncomplicated rules.

In this paper we study the problem of the existence of a least-action principle for invertible, second-order dynamical systems, discrete in time and space. We show that, when the configuration space is finite, a least-action principle does not exist for such systems. We dichotomize discrete dynamical systems with infinite configuration spaces into those of finite type for which this theorem continues to hold, and those not of finite type for which it is possible to construct a least-action principle. We also show how to recover an action by restriction of the phase space of certain second-order discrete dynamical systems. We provide numerous examples to illustrate each of these results.

In this paper, we present a 4-state solution to the Firing Squad Synchronization Problem (FSSP) based on hybrid rule 60/102 Cellular Automata(CA). This solution solves the problem on the line of length 2^n with two generals. Previous work on FSSP for 4-state systems focused mostly on linear cellular automata, where synchronizes an infinite number of lines but not all possible lines. We give time-optimal solutions to synchronize an infinite number of lines by rule 60 and rule 102 respectively, and construct a hybrid rule 60 and 102 states transition table. Compared to the known solutions of cellular automata, the hybrid CA way is simpler and faster, the minimal time is (n-1) step.

The s2s-OVCA is a cellular automaton (CA) hybrid of the optimal velocity (OV) model and the slow-to-start (s2s) model, which is introduced in the framework of the ultradiscretization method. Inverse ultradiscretization as well as the time continuous limit, which lead the s2s-OVCA to an integral-differential equation, are presented. Several traffic phases such as a free flow as well as slow flows corresponding to multiple metastable states are observed in the flow-density relations of the s2s-OVCA. Based on the properties of the stationary flow of the s2s-OVCA, the formulas for the flow-density relations are derived.

In this article a stochastic cellular automata model is examined, which has been developed to study a "small" world, where local changes may noticeably alter global characteristics. This is applied to a climate model, where global temperature is determined by an interplay between atmospheric carbon dioxide and carbon stored by plant life. The latter can be relased by forest fires, giving rise to significant changes of global conditions within short time.

In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling of cellular automata. We identify local behaviors of cellular automata with coKleisli maps of the exponent comonad on the category of uniform spaces and uniformly continuous functions and exploit this equivalence to conclude some standard results about cellular automata as instances of basic category-theoretic generalities. In particular, we recover Ceccherini-Silberstein and Coornaert's version of the Curtis-Hedlund theorem.

In this article, we have proposed an epidemic model by using probability cellular automata theory. The essential mathematical features are analyzed with the help of stability theory. We have given an alternative modelling approach for the spatiotemporal system which is more realistic and satisfactory from the practical point of view. A discrete and spatiotemporal approach are shown by using cellular automata theory. It is interesting to note that both size of the endemic equilibrium and density of the individual increase with the increasing of the neighborhood size and infection rate, but the infections decrease with the increasing of the recovery rate. The stability of the system around the positive interior equilibrium have been shown by using suitable Lyapunov function. Finally experimental data simulation for SARS disease in China and a brief discussion conclude the paper.

We study tram priority at signalized intersections using a stochastic cellular automaton model for multimodal traffic flow. We simulate realistic traffic signal systems, which include signal linking and adaptive cycle lengths and split plans, with different levels of tram priority. We find that tram priority can improve service performance in terms of both average travel time and travel time variability. We consider two main types of tram priority, which we refer to as full and partial priority. Full tram priority is able to guarantee service quality even when traffic is saturated, however, it results in significant costs to other road users. Partial tram priority significantly reduces tram delays while having limited impact on other traffic, and therefore achieves a better result in terms of the overall network performance. We also study variations in which the tram priority is only enforced when trams are running behind schedule, and we find that those variations retain almost all of the benefit for tram operations but with reduced negative impact on the network.

A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings.