相关论文: Stability in random Boolean cellular automata on t…
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
We consider a probabilistic cellular automaton to analyze the stochastic dynamics of a predator-prey system. The local rules are Markovian and are based in the Lotka-Volterra model. The individuals of each species reside on the sites of a…
We investigate stability properties of a probabilistic cellular automaton based on the candy crush game.
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
Many biological systems, such as metabolic pathways, exhibit bistability behavior: these biological systems exhibit two distinct stable states with switching between the two stable states controlled by certain conditions. Since…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semi-annealed approximation to study the stability properties of Random Boolean Networks…
Cellular automata (CA) are dynamical systems on symbolic configurations on the lattice. They are also used as models of massively parallel computers. As dynamical systems, one would like to understand the effect of small random…
Boolean networks have been proposed as potentially useful models for genetic control. An important aspect of these networks is the stability of their dynamics in response to small perturbations. Previous approaches to stability have assumed…
The regulation of the cell state is a complex process involving several components. These complex dynamics can be modeled using Boolean networks, allowing us to explain the existence of different cell states and the transition between them.…
A novel model of biological organisms is advanced, treating an organism as a self-consistent system subject to a pathogen flux. The principal novelty of the model is that it describes not some parts, but a biological organism as a whole.…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
The recently measured yeast transcriptional network is analyzed in terms of simplified Boolean network models, with the aim of determining feasible rule structures, given the requirement of stable solutions of the generated Boolean…
Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the consistency between its rules, its perception-based…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
We present a characterization of short-term stability of random Boolean networks under \emph{arbitrary} distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…