Related papers: Growing Random Strings in CA
Granular materials are very common in the everyday world. Media such as sand, soil, gravel, food stuffs, pharmaceuticals, etc. all have similar irregular flow since they are composed of numerous small solid particles. In video games,…
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…
Many natural processes occur over characteristic spatial and temporal scales. This paper presents tools for (i) flexibly and scalably coarse-graining cellular automata and (ii) identifying which coarse-grainings express an automaton's…
This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and…
It is known that chaotic systems have widely been used in cryptography. Generally, floating point simulations are used to generate pseudo-random sequence of numbers. Although, it is possible to find some works on the degradation of chaotic…
We consider the problem of computing a response curve for binary cellular automata -- that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how…
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…
We prove the existence of a semilinear representation of Cellular Automata (CA) with the introduction of multiple convolution kernels. Examples of the technique are presented for rules akin to the "edge-of-chaos" including the Turing…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at…
We consider the problem of computing a response curve for binary cellular automata -- that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how…
We revisit constructions for distribution and synthesis of Zielonka's asynchronous automata in restricted settings. We show first a simple, quadratic, distribution construction for asynchronous automata, where the process architecture is…
The biological process of gene assembly has been modeled based on three types of string rewriting rules, called string pointer rules, defined on so-called legal strings. It has been shown that reduction graphs, graphs that are based on the…
Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building…
We derive a set of algorithms for simulating the diffusion-limited growth of faceted crystals using local cellular automata. This technique has been shown to work well in reproducing realistic crystal morphologies, and the present work…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
The Gamma distribution is well-known and widely used in many signal processing and communications applications. In this letter, a simple and extremely efficient accept/reject algorithm is introduced for the generation of independent random…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
The canonical Monte-Carlo algorithm for simulating the production of string-like topological defects at a phase transition is extended by introducing a distribution of domain sizes. A strong correlation is found between the fraction in the…