A survey of cellular automata: types, dynamics, non-uniformity and applications
From MaRDI portal
Publication:6151179
DOI10.1007/s11047-018-9696-8zbMath1530.68158arXiv1607.02291OpenAlexW2963131442MaRDI QIDQ6151179
Kamalika Bhattacharjee, Souvik Roy, Sukanta Das, Nazma N. Naskar
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.02291
Related Items
Cites Work
- Probing robustness of cellular automata through variations of asynchronous updating
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Solving the parity problem in one-dimensional cellular automata
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Three research directions in non-uniform cellular automata
- Realization problems for nonuniform cellular automata
- The firing squad synchronization problem on CA with multiple updating cycles
- Reversibility of linear cellular automata
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Communication complexity in number-conserving and monotone cellular automata
- Two-dimensional cellular automata
- Four states are enough!
- Outer-totalistic cellular automata on graphs
- Reversible simulation of one-dimensional irreversible cellular automata
- Asynchronous mappings and asynchronous cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Computation theoretic aspects of cellular automata
- Reversibility of 2D cellular automata is undecidable
- Transition phenomena in cellular automata rule space
- Invertible cellular automata: A review
- Conservation of some dynamical properties for operations on cellular automata
- Reversible computing and cellular automata -- a survey
- On the directional dynamics of additive cellular automata
- Algebraic properties of cellular automata
- Linear cellular automata over \(Z_ m\)
- Random sequence generation by cellular automata
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- Synchronous to asynchronous transformation of polyautomata
- Conservative logic
- Additive conserved quantities in discrete-time lattice dynamical systems
- An efficient solution of the firing mob problem
- On characterization of cellular automata with matrix algebra
- Fault tolerant cellular spaces
- On reversibility in cellular automata
- Computation and construction universality of reversible cellular automata
- Certain relations between properties of maps of tessellation automata
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Injectivity and surjectivity of parallel maps for cellular automata
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- On the dynamical behavior of chaotic cellular automata
- Amenable groups and cellular automata
- Discrete parabolas and circles on 2D cellular automata
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Reversibility and surjectivity problems of cellular automata
- Asynchronous automata versus asynchronous cellular automata
- Dynamical properties of expansive one-sided cellular automata
- Lyapunov exponents for one-dimensional cellular automata
- Number conserving cellular automata. II: Dynamics.
- Investigating topological chaos by elementary cellular automata dynamics
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Graph-theoretical characterization of invertible cellular automata
- Asynchronous cellular automata for pomsets
- Theory of cellular automata: a survey
- The 3-dimensional cellular automata for HIV infection
- Comparison between simultaneous and sequential updating in \(2^{n+1}-1\) cellular automata
- Simple 8-state minimal time solution to the firing squad synchronization problem
- Automorphisms of \(\mathbb Z^ d\)-subshifts of finite type
- Universality and decidability of number-conserving cellular automata
- Number-conserving cellular automata I: Decidability.
- Solution of some conjectures about topological properties of linear cellular automata
- Two-dimensional cellular automata and their neighborhoods
- Computation of shortest path in cellular automata
- Characterisation of a particular hybrid transformation of two-dimensional cellular automata
- CAR30: a new scalable stream cipher with rule 30
- Structure and reversibility of 2D hexagonal cellular automata
- Block cipher based on reversible cellular automata
- Parameter characterization of two-dimensional cellular automata rule space
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Asynchronous cellular automata and dynamical properties
- Number-Conserving Reversible Cellular Automata and Their Computation-Universality
- About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane
- Characterization of Single Cycle CA and its Application in Pattern Classification
- Characterization of 1-d Periodic Boundary Reversible CA
- REVERSIBILITY ALGORITHMS FOR 3-STATE HEXAGONAL CELLULAR AUTOMATA WITH PERIODIC BOUNDARIES
- Conceptual Connections around Density Determination in Cellular Automata
- Advances on Random Sequence Generation by Uniform Cellular Automata
- On the generation of high-quality random numbers by two-dimensional cellular automata
- Generalized Automata Networks
- Cellular Automata Based Encoding Technique for Wavelet Transformed Data Targeting Still Image Compression
- An Analytical Formulation for Cellular Automata (CA) Based Solution of Density Classification Task (DCT)
- Characterization of Non-reachable States in Irreversible CA State Space
- Non-uniform Cellular Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical mechanics of cellular automata
- Cellular automaton rules conserving the number of active sites
- One-way bounded cellular automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Condition for injectivity of global maps for tessellation automata
- Languages, equicontinuity and attractors in cellular automata
- Analysis of periodic and intermediate boundary 90/150 cellular automata
- Design of CAECC - cellular automata based error correcting code
- Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines
- CELLULAR AUTOMATON MODELS OF TUMOR DEVELOPMENT: A CRITICAL REVIEW
- Probabilistic cellular automata with conserved quantities
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Asynchrony Immune Cellular Automata
- Algebraic Theory of Automata Networks
- Group Properties of Cellular Automata and VLSI Applications
- Leader election in d-dimensional CA in time diam log(diam)
- Conservation laws in cellular automata
- HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
- Transitive Cellular Automata are Sensitive
- Computing Issues of Asynchronous CA
- Theory and Application of Equal Length Cycle Cellular Automata (ELCCA) for Enzyme Classification
- Cellular Automata Modeling of Physical Systems
- Universality of Reversible Hexagonal Cellular Automata
- On the interconnection structure of cellular networks
- Petri net implementations by a universal cell space
- Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Collective dynamics of ‘small-world’ networks
- Vector space theoretic analysis of additive cellular automata and its application for pseudoexhaustive test pattern generation
- PERFORMANCE AND ROBUSTNESS OF CELLULAR AUTOMATA COMPUTATION ON IRREGULAR NETWORKS
- Self-Replicating Patterns in 2D Linear Cellular Automata
- Reversibility of Elementary Cellular Automata under Fully Asynchronous Update
- Cellular Automata Based Encompression Technology for Voice Data
- Characterization of Reachable/Nonreachable Cellular Automata States
- Developments in Language Theory
- Simple self-reproducing universal automata
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Endomorphisms and automorphisms of the shift dynamical system
- The Garden-of-Eden Theorem for Finite Configurations
- Simple Computation-Universal Cellular Spaces
- Cellular automata complexity trade-offs
- A logical calculus of the ideas immanent in nervous activity
- A perimeter--time CA for the queen bee problem
- Evolving two-dimensional cellular automata to perform density classification: A report on work in progress
- NP problems are tractable in the space of cellular automata in the hyperbolic plane
