相关论文: Predicting Non-linear Cellular Automata Quickly by…

To test generalization ability of a class of deep neural networks, we randomly generate a large number of different rule sets for 2-D cellular automata (CA), based on John Conway's Game of Life. Using these rules, we compute several…

Cellular automata (CA) models are widely used to simulate complex systems with emergent behaviors, but identifying hidden parameters that govern their dynamics remains a significant challenge. This study explores the use of Convolutional…

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,…

Neural Cellular Automata (NCAs) are bio-inspired dynamical systems in which identical cells iteratively apply a learned local update rule to self-organize into complex patterns, exhibiting regeneration, robustness, and spontaneous dynamics.…

Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…

In this paper, we present a novel algorithm to optimize the design of Reservoir Computing using Cellular Automata models for time series applications. Besides selecting the models' hyperparameters, the proposed algorithm particularly solves…

In studying the predictability of emergent phenomena in complex systems, Israeli & Goldenfeld (Phys. Rev. Lett., 2004; Phys. Rev. E, 2006) showed how to coarse-grain (elementary) cellular automata (CA). Their algorithm for finding…

Parallel algorithms for solving any image processing task is a highly demanded approach in the modern world. Cellular Automata (CA) are the most common and simple models of parallel computation. So, CA has been successfully used in the…

Cellular automata (CAs) and convolutional neural networks (CNNs) are closely related due to the local nature of information processing. The connection between these topics is beneficial to both related fields, for conceptual as well as…

A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…

Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and S-boxes. However, most of the research in this field, except the very early works, seems to be…

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…

Cellular automata (CA) are well-studied models of decentralized parallel computation, known for their ability to exhibit complex global behavior from simple local rules. While their dynamics have been widely explored through simulations, a…

Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In…

We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity…

This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…

A new class of linear sequence generators based on cellular automata is here introduced in order to model several nonlinear keystream generators with practical applications in symmetric cryptography. The output sequences are written as…

To respect physics and nature, cellular automata (CA) models of self-organisation, emergence, computation and logical universality should be isotropic, having equivalent dynamics in all directions. We present a novel paradigm, the iso-rule,…

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…

While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…