Related papers: Transmitting-state invertible cellular automata
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
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…
Cellular automata can show well known features of quantum mechanics, such as a linear updating rule that resembles a discretized form of the Schr\"odinger equation together with its conservation laws. Surprisingly, a whole class of…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
We consider mutual information between release times and capture times for a set of M identical quanta traveling independently from a source to a target. The quanta are immediately captured upon arrival, first-passage times are assumed…
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…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
Grid-forming inverters control the power transfer between the AC and DC sides of an electrical grid while maintaining the frequency and voltage of the AC side. This paper focuses on ensuring large-signal stability of an electrical grid with…
State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions.…
Non-uniform cellular automata (NUCA) are an extension of cellular automata (CA), which transform cells according to multiple different local rules. A NUCA is defined by a configuration of local rules called a local rule distribution. We…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
A general scheme for construction of dynamical systems able to learn generation of the desired kinds of dynamics through adjustment of their internal structure is proposed. The scheme involves intrinsic time-delayed feedback to steer the…
The novel idea presented in this paper is to interweave distributed model predictive control with a reliable scheduling of the information that is interchanged between local controllers of the plant subsystems. To this end, a dynamic model…
We consider the problem of designing learning-based reactive power controllers that perform voltage regulation in distribution grids while ensuring closed-loop system stability. In contrast to existing methods, where the provably stable…
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…
To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to…
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 study the space evolution in the Rule 54 reversible cellular automaton, which is a paradigmatic example of a deterministic interacting lattice gas. We show that the spatial translation of time configurations of the…
These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph…