Related papers: Toward a Boundary Regional Control Problem for Boo…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
We study the target control of asynchronous Boolean networks, to identify efficacious interventions that can drive the dynamics of a given Boolean network from any initial state to the desired target attractor. Based on the application…
We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single…
In this paper, we formalize precisely the sense in which the application of cellular automaton to partial configuration is a natural extension of its local transition function through the categorical notion of Kan extension. In fact, the…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
A common goal in the control of a large network is to minimize the number of driver nodes or control inputs. Yet, the physical determination of control signals and the properties of the resulting control trajectories remain widely…
The prediction of the behavior of the disease, the level of affectation in a population and the ways to control it are the most important aspects studied by epidemiology using tools such as historical data and mathematical models. So, our…
A cellular automaton model is presented for random walkers with biologically motivated interactions favoring local alignment and leading to collective motion or swarming behavior. The degree of alignment is controlled by a sensitivity…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
Ultimate bounds on the maximum operating frequency of networks of quantum dot cellular automata devices have yet to be established. We consider the adiabaticity of such networks in the two-state approximation where clocking is achieved via…
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) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebraic systems, focusing on the combinatorial designs induced by…
This paper introduces a hierarchical cellular automaton (HCA)model for simulation of distributed self-organizing control of traffic signals at intersections in road network. The proposed HCA consists of three hierarchy levels that describe…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
In this paper, we consider partially observable timed automata endowed with a single clock. A time interval is associated with each transition specifying at which clock values it may occur. In addition, a resetting condition associated to a…
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the…
The problem of the exact bounded control of oscillations of the two-dimensional wave equation is considered. Control force is applied to the boundary of the membrane, which is located in a domain on a plane. The goal of the control is to…