Related papers: Motion representation of one-dimensional cellular …
Computing the configuration of any one-dimensional cellular automaton at generation $n$ can be accelerated by constructing and running a composite rule with a radius proportional to $\log n$. The new automaton is the original one, but with…
Given a (finite) string of zeros and ones, we report a way to determine if the number of ones is less than, greater than, or equal to a prescribed number by applying two sets of cellular automaton rules in succession. Thus, we solve the…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…
We construct a two dimensional Cellular Automata based model for the description of pedestrian dynamics. Wide range of complicated pattern formation phenomena in pedestrian dynamics are described in the model, e.g. lane formation, jams in a…
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a…
In this article, we consider abstract linear conservative systems and their time-discrete counterparts. Our main result is a representation formula expressing solutions of the continuous model through the solution of the corresponding…
The dynamic complexity of robots and mechatronic systems often pertains to the hybrid nature of dynamics, where governing equations consist of heterogenous equations that are switched depending on the state of the system. Legged robots and…
We investigate second order additive invariants in elementary cellular automata rules. Fundamental diagrams of rules which possess additive invariants are either linear or exhibit singularities similar to singularities of rules with…
We propose a calibrated two-dimensional cellular automaton model to simulate pedestrian motion behavior. It is a v=4 (3) model with exclusion statistics and random shuffled dynamics. The underlying regular grid structure results in a…
In this paper, we derive equations of motion for the normal-order, the symmetric-order and the antinormal-order quantum characteristic functions, applicable for general Hamiltonian systems. We do this by utilizing the `characteristic form'…
We show that the common component of the Generalised Dynamic Factor Model (GDFM) can be represented using only current and past observations basically whenever it is purely non-deterministic.
In this paper I describe a cellular automaton model of a multi-species ecosystem, suitable for the study of emergent properties of macroevolution. Unlike majority of ecological models, the number of coexisting species is not fixed. Starting…
This paper proposes a new set of conditions for exactly representing collision avoidance constraints within optimization-based motion planning algorithms. The conditions are continuously differentiable and therefore suitable for use with…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…
The one-dimensional dynamics of identical discrete elements that combine the properties of newtonian mechanical particles and cellular automata are investigated. It is shown that the motion of a cluster of combined discrete elements, which…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
We present Mass-Conserving Evolution (MaCE), a general method for implementing mass conservation in Cellular Automata (CA). MaCE is a simple evolution rule that can be easily 'attached' to existing CAs to make them mass-conserving, which…