Space-Time Directional Lyapunov Exponents for Cellular Automata

Space-time directional Lyapunov exponents are introduced. They describe the maximal velocity of propagation to the right or to the left of fronts of perturbations in a frame moving with a given velocity. The continuity of these exponents as function of the velocity and an inequality relating them to the directional entropy is proved.     

Simulation of the nonlinear vibration of a string using the Cellular Automata based on the reflection rule

In this study, the nonlinear dynamic responses of a string are simulated using the Cellular Automata method based on the reflection rule. In the case of nonlinear systems, the velocity of wave propagation is not constant and depends on the amplitude. A new treatment of the dynamic time step is proposed for the Cellular Automata method considering the effect of the propagation velocity. As numerical examples, first, the dynamic responses of a string with linear characteristic are simulated using the Cellular Automata method. A typical resonance curve can be obtained. Second, the dynamic responses of a string with nonlinear characteristic are simulated using the proposed method. Some characteristic types of vibration can be obtained. It is concluded that the linear and nonlinear dynamic responses of a string may be obtained by simulation using the Cellular Automata method.     

随机化交通灯的二维元胞自动机交通模型

元胞自动机交通模型以简单的规则反映交通系统中的多种因素，可以分析各种交通现象，且可在计算机上方便、高效地运作·Ｂｉｈａｍ－Ｍｉｄｄｌｅｔｏｎ－Ｌｅｖｉｎｅ模型（ＢＭＬ模型）实现了二维交通问题的元胞自动机模型的模拟研究·本文对ＢＭＬ模型作了改进，解除了该模型中关于交通灯同步变化的限制·在新模型中，每个路口的交通灯可以自由选定起始工作时间和变化节奏，于是可以更全面、准确地反映交通灯对交通系统性能的影响·本文还对新模型中出现的若干新效应作了解释·     

屋顶绿化的自动灌溉系统设计

屋顶绿化对提高城市空气质量、减少“热岛效应”、改善居住环境有积极的意义，但其灌溉环节与普通园林绿化灌溉相比有更高的要求．为了增强屋顶灌溉的科学性，根据其特点提出了建立自动灌溉系统的设想，并对灌溉过程建立了混杂自动机模型，从离散事件动态系统与连续变量动态系统的角度共同描述了自动灌溉的过程，最后给出了自动灌溉系统的工程设计方案，对屋顶绿化自动化、精细化程度的提高具有一定的启示意义．     

The emergence of dynamical complexity: An exploration using elementary cellular automata

This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004     

Emergence of self-replicating structures in a cellular automata space

Past cellular automata models of self-replication have always been initialized with an original copy of the structure that will replicate, and have been based on a transition function that only works for a single, specific structure. This article demonstrates for the first time that it is possible to create cellular automata models in which a self-replicating structure emerges from an initial state having a random density and distribution of individual components. These emergent self-replicating structures employ a fairly general rule set that can support the replication of structures of different sizes and their growth from smaller to larger ones. This rule set also allows “random” interactions of self-replicating structures with each other and with other structures within the cellular automata space. Systematic simulations show that emergence and growth of replicants occurs often and is essentially independent of the cellular space size, initial random pattern of components, and initial density of components, over a broad range of these parameters. The number of replicants and the total number of components they incorporate generally approach quasi-stable values with time.     

Xor on one‐defect systems

We present a network experiment that investigates the computational power of cellular automata on the simplest irregular lattice. One cellular automaton whose apparent complexity increased is Rule 60, the left neighbor Xor operator. It went from being nested to complex. That makes Xor a candidate for universal computational power. We present the evidence in terms of the size of cycle lengths, transients, and size of boolean expressions. © 2006 Wiley Periodicals, Inc. Complexity 12: 13–29, 2006     

Two-spin-majority cellular automaton as a model of 2D cluster and interface growth

A new probabilistic cellular automaton model is introduced to simulate cluster and interface growth in two dimensions. The dynamics of this model is an extension to higher dimensions of the compact directed percolation studied by Essam. Numerical results indicate that the two-dimensional cluster coarsening and growth can be described only approximately by the conventional cluster size scaling due to a crossover in the growth mode. The spreading of the initially flat interface follows a purely diffusional,t ^1/2, law.     

Cluster growth in particle-conserving cellular automata

A class of simple two-dimensional cellular automata with particle conservation is proposed for easy simulations of interacting particle systems. The automata are defined by the exchange of states of neighboring cells, depending on the configurations around the cells. By attributing an energy to a configuration of cells, we can select significant rules from the huge number of possible rules and classify them into several groups, based on the analogy with a binary alloy. By numerical calculations, cluster growth is found in two kinds of phases which reveal gas-solid coexistence and liquid droplets. Normalized scaling functions are obtained, and dynamical scaling is examined.     

On irreversibility of von Neumann additive cellular automata on grids

The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ⁺-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ⁺-automata.