Invertible cellular automata: A review
From MaRDI portal
Publication:807058
DOI10.1016/0167-2789(90)90185-RzbMATH Open0729.68066OpenAlexW2039585018WikidataQ30054102 ScholiaQ30054102MaRDI QIDQ807058FDOQ807058
Authors: Tommaso Toffoli, Norman H. Margolus 
Publication date: 1990
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-2789(90)90185-r
Recommendations
Cites Work
- Conservative logic
- Information Theory and Statistical Mechanics
- Invariant in cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reversible parallel computation: An evolving space-model
- Cellular automaton fluids. I: Basic theory
- Local structure theory for cellular automata
- Logical Reversibility of Computation
- Reversibility and surjectivity problems of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Statistical mechanics of cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tesselations with local transformations
- Title not available (Why is that?)
- Bicontinuous extensions of invertible combinatorial functions
- Computation theory of cellular automata
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- Reversibility of 2D cellular automata is undecidable
- Two-dimensional cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation and construction universality of reversible cellular automata
- A hierarchical classification of cellular automata
- Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some clarifications of the concept of a Garden-of-Eden configuration
- Strong surjectivity is equivalent to C-injectivity
- State-transition structures in physics and in computation
- Certain relations between properties of maps of tessellation automata
- Injectivity and surjectivity of parallel maps for cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Condition for injectivity of global maps for tessellation automata
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- The automorphisms of the shift dynamical system are relatively sparse
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representation of geometrical and topological quantities in cellular automata
- Relaxation properties of elementary reversible cellular automata
Cited In (84)
- A lattice Boltzmann equation for diffusion
- Fast reversible language recognition using cellular automata
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
- The surjectivity problem for 2D cellular automata
- Randomness on full shift spaces
- Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata
- Computation in reversible cellular automata
- Statistical mechanics of surjective cellular automata
- Reversible computing and cellular automata -- a survey
- Time-reversal symmetry in dynamical systems: a survey
- From quantum cellular automata to quantum lattice gases
- Reversible computing from a programming language perspective
- On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
- Investigation on the three-dimensional multiphase conjugate conduction problem inside porous wick with the lattice Boltzmann method
- Surjunctivity and reversibility of cellular automata over concrete categories
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Theory of cellular automata: a survey
- Self-reproduction in a reversible cellular space
- Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
- Number-conserving reversible cellular automata and their computation-universality
- How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
- Transformations of one-dimensional cellular automaton rules by translation-invariant local surjective mappings
- Partial reversibility of one-dimensional cellular automata
- On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
- Reversible cellular automata with memory: two-dimensional patterns from a single site seed
- Secret image sharing based on cellular automata and steganography
- Title not available (Why is that?)
- A verifiable multi-secret sharing scheme based on cellular automata
- A secure scheme to share secret color images
- Inverse rules of ECA with rule number 150
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Parallel dynamical systems over graphs and related topics: a survey
- The complexity of reversible cellular automata
- Invertible shift-invariant transformations on binary arrays
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- On the absence of homogeneous scalar unitary cellular automata.
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- On time-symmetry in cellular automata
- Description of systematicity intrinsic to the dynamics of complex-system models.
- Nonequilibrium physics aspects of probabilistic cellular automata
- Predecessors of cellular automata states. II: Pre-images of finite sequences
- A multisecret sharing scheme for color images based on cellular automata
- Title not available (Why is that?)
- Universality of Reversible Hexagonal Cellular Automata
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Computational universes
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Continuity of information transport in surjective cellular automata
- Nondeterministic cellular automata
- Universality of a reversible two-counter machine
- Invertible behavior in elementary cellular automata with memory
- Graph-theoretical characterization of invertible cellular automata
- Additive cellular automata and global injectivity
- Running programs backwards: The logical inversion of imperative computation
- Representation of reversible cellular automata with block permutations
- A Random NP-complete problem for inversion of 2D cellular automata
- The reachability problem for finite cellular automata
- Structure of the invertible CA transformations group
- Reversibility of computations in graph-walking automata
- A two-layer representation of four-state reversible number-conserving 2D cellular automata
- Cellular automata with random memory and its implementations
- Analysis of quantum particle automata for solving the density classification problem
- Hybrid one-dimensional reversible cellular automata are regular
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
- Waiting for the rapture: what can we do with computers to (hopefully) witness the emergence of life?
- Characterization of 1-d periodic boundary reversible CA
- Block cipher based on reversible cellular automata
- Generation of pseudo-isomorphic cellular automata
- UNCONVENTIONAL INVERTIBLE BEHAVIORS IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
- A new symmetrical cryptosystem based cellular automata and chaotic map function
- CONSTRUCTION OF REVERSIBLE LATTICE MOLECULAR AUTOMATA
- What Automata Can Provide a Medium for Life?
- Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets
- Reversible spiking neural P systems
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Autonomous population regulation using a multi-agent system in a prey-predator model that integrates cellular automata and the African buffalo optimization metaheuristic
- Model discovery and discrete inverse problems with cellular automata and Boolean networks
- Title not available (Why is that?)
- Distributed multi-authority attribute-based encryption using cellular automata
- A random NP-complete problem for inversion of 2D cellular automata
- CELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTS
- Modelling reliability of reversible circuits with 2D second-order cellular automata
This page was built for publication: Invertible cellular automata: A review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807058)
