元胞自动机与格子气
The Game of Life (GoL), one well known 2D cellular automaton, does not typically ensure interesting long-term phenotypic dynamics. Therefore, while being Turing complete, GoL cannot be said to be open-ended. In this work, we extend GoL with…
Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in…
Cellular automata (CA) exemplify systems where simple local interaction rules can lead to intricate and complex emergent phenomena at large scales. The various types of dynamical behavior of CA are usually categorized empirically into…
The colloid cellular automata do not imitate the physical structure of colloids but are governed by logical functions derived from the colloids. We analyse the space-time complexity of Boolean circuits derived from the electrical responses…
For a group $G$ and a finite set $A$, a cellular automaton (CA) is a transformation $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local map $\mu : A^S \to A$. Although memory sets are not unique, every CA admits…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
Peter Gacs proposed a one-dimensional cellular automaton capable of a robust self-reproduction. Because the automaton is exceptionally large and complicated, very few people have ever succeeded in simulating it on a computer or analyzing…
We present a ridership model of individual trajectories of users within a public transport network for which there are several different routes between origin and destiny and for which the automatic fare collection data does not include…
A cellular automaton (CA)-based modeling approach to simulate wildfire spread, emphasizing its strengths in capturing complex fire dynamics and its integration with geographic information systems (GIS). The model introduces an enhanced…
Among the fundamental questions in computer science is that of the impact of synchronism/asynchronism on computations, which has been addressed in various fields of the discipline: in programming, in networking, in concurrence theory, in…
Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…
An important question to be addressed regarding system control on a time interval $[0, T]$ is whether some particular target state in the configuration space is reachable from a given initial state. When the target of interest refers only…
Machine learning (ML) of phase transitions (PTs) has gradually become an effective approach that enables us to explore the nature of various PTs more promptly in equilibrium and nonequilibrium systems. Unlike equilibrium systems,…
Many simulated complex systems that support persistent self-organizing patterns, i.e. gliders, have a 'state-plus-update' paradigm. This approach can be found in computational models of physics, continuous and neural cellular automata,…
Mathematical models describing the spatial spreading and invasion of populations of biological cells are often developed in a continuum modelling framework using reaction-diffusion equations. While continuum models based on linear diffusion…
We present a novel form of Liquid Automata, using this to simulate autopoiesis, whereby living machines self-organise in the physical realm. This simulation is based on an earlier Cellular Automaton described by Francisco Varela. The basis…
This article introduces the notion of clouds in asynchronous cellular automata (ACAs). We show that the cloud behaviour of ACAs has similarity with natural clouds across the sky, election model of parliamentary democratic system, and…
The state of limit cycles for a tropically discretized Sel'kov model becomes ultradiscrete due to phase lock caused by a saddle-node bifurcation. This property is essentially the same as the case of the negative feedback model, and…
We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion…