相关论文: Order Independence in Asynchronous Cellular Automa…
A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are read,…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…
This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are…
Cellular automata generate spatially extended, temporally persistent emergent structures from local update rules. No general method derives the mechanisms of that generation from the rule itself; existing tools reconstruct structure from…
Most current methods for identifying coherent structures in spatially-extended systems rely on prior information about the form which those structures take. Here we present two new approaches to automatically filter the changing…
Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjacent variables. Capitalizing on the structure of the graph,…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
This paper considers a dynamic coverage problem for sensor networks that are sufficiently dense but not localized. Only a small fraction of sensors may be in an awake state at any given time. The goal is to find a decentralized protocol for…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
Relation between global transition function and local transition function of a homogeneous one dimensional cellular automaton (CA) is investigated for some standard transition functions. It could be shown that left shift and right shift CA…
Cells in a fungal hyphae are separated by internal walls (septa). The septa have tiny pores that allow cytoplasm flowing between cells. Cells can close their septa blocking the flow if they are injured, preventing fluid loss from the rest…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
The self-energy-functional approach (SFA) is discussed in the context of different variational principles for strongly correlated electron systems. Formal analogies between static and dynamical variational approaches, different types of…
There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…
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…
The dynamic properties and independence structure of stochastic kinetic models (SKMs) are analyzed. An SKM is a highly multivariate jump process used to model chemical reaction networks, particularly those in biochemical and cellular…
Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic,…
We present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA…