元胞自动机与格子气

We propose a new method to construct an isotropic cellular automaton corresponding to a reaction-diffusion equation. The method consists of replacing the diffusion term and the reaction term of the reaction-diffusion equation with a random…

The dynamics of a physical system is linked to its phase-space geometry by Noether's theorem, which holds under standard hypotheses including continuity. Does an analogous theorem hold for discrete systems? As a testbed, we take the Ising…

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…

Two novel computing models based on an infinite tessellation of space-time are introduced. They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the…

We investigate the dynamical transition from free-flow to jammed traffic, which is related to the divergence of the relaxation time and susceptibility of the energy dissipation rate $E_d$, in the Nagel-Schreckenberg (NS) model with two…

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We…

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…

In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterized by having its heads…

A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This is only one step more than a lower bound.

Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the…

We study Markovian and non-Markovian behaviour of stochastic processes generated by $p$-adic random dynamical systems. Given a family of $p$-adic monomial random mappings generating a random dynamical system. Under which conditions do the…

Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). In this paper, we study how the asynchronism and the graph…

A beta-skeleton is a planar proximity undirected graph of an Euclidean point set where nodes are connected by an edge if their lune-based neighborhood contains no other points of the given set. Parameter $\beta$ determines size and shape of…

In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and…

A mutualism is an interaction where the involved species benefit from each other. We study a two-dimensional hexagonal three-state cellular automaton model of a two-species mutualistic system. The simple model is characterized by four…

We study a one-dimensional lattice gas "dynamical geometry model" in which local reversible interactions of counter-rotating groups of particles on a ring can create or destroy lattice sites. We exhibit many periodic orbits and and show…

We propose a method for deriving networks from one-dimensional binary cellular automata. The derived networks are usually directed and have structural properties corresponding to the dynamical behaviors of their cellular automata. Network…

We present both simulated and partial empirical evidence for the computational utility of many connected vesicle analogs of an encapsulated non-linear chemical processing medium. By connecting small vesicles containing a solution of…

We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…