Reversible computing and cellular automata -- a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 2050943 (Why is no real title available?)
- scientific article; zbMATH DE number 1738656 (Why is no real title available?)
- scientific article; zbMATH DE number 1746682 (Why is no real title available?)
- scientific article; zbMATH DE number 2087234 (Why is no real title available?)
- scientific article; zbMATH DE number 3253170 (Why is no real title available?)
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3370262 (Why is no real title available?)
- scientific article; zbMATH DE number 3370263 (Why is no real title available?)
- A Universal Reversible Turing Machine
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Bicontinuous extensions of invertible combinatorial functions
- Computation and construction universality of reversible cellular automata
- Condition for injectivity of global maps for tessellation automata
- Conservative logic
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Firing squad synchronization problem in reversible cellular automata
- Four Small Universal Turing Machines
- Injectivity and surjectivity of parallel maps for cellular automata
- Invertible cellular automata: A review
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Machines, Computations, and Universality
- Procedures for calculating reversible one-dimensional cellular automata
- Reversibility and surjectivity problems of cellular automata
- Self-reproduction in a reversible cellular space
- Simple universal one-dimensional reversible cellular automata
- Small Semi-weakly Universal Turing Machines
- Small universal Turing machines
- Surprising areas in the quest for small universal devices
- Tesselations with local transformations
- The Garden-of-Eden Theorem for Finite Configurations
- Theory of cellular automata: a survey
- Time/Space Trade-Offs for Reversible Computation
- Universality in elementary cellular automata
- Universality of a reversible two-counter machine
Cited in
(69)- Theory of reversible computing
- Reversible computation in nature inspired rule-based systems
- The computing power of determinism and reversibility in chemical reaction automata
- Modelling reliability of reversible circuits with 2D second-order cellular automata
- Dual P Systems
- Reversibility in the higher-order \(\pi\)-calculus
- Reversible top-down syntax analysis
- A class of recursive permutations which is primitive recursive complete
- Cold dynamics in cellular automata: a tutorial
- One-way reversible multi-head finite automata
- The complexity of iterated reversible computation
- When input-driven pushdown automata meet reversiblity
- On the image set and reversibility of shift morphisms over discrete alphabets
- scientific article; zbMATH DE number 2013811 (Why is no real title available?)
- Reversibility of linear cellular automata
- Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
- Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements
- How can we construct reversible machines out of reversible logic element with memory?
- Characterization of random fluctuation-based computation in cellular automata
- Reversible limited automata
- Reversing computation in membrane systems
- Computation in reversible cellular automata
- Towards a taxonomy for reversible computation approaches
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Logical gates via gliders collisions
- A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- Reversible pushdown automata
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Reversibility and universality. Essays presented to Kenichi Morita on the occasion of his 70th birthday
- Aspects of reversibility for classical automata
- Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
- Real-time reversible one-way cellular automata
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- Machines, Computations, and Universality
- Hierarchy and expansiveness in 2D subshifts of finite type
- On reversible Turing machines and their function universality
- Reversible Top-Down Syntax Analysis
- Description of reversibility of 9-cyclic 1D finite linear cellular automata with periodic boundary conditions
- From reversible programming languages to reversible metalanguages
- Fluctuation-driven computing on number-conserving cellular automata
- On 1D reversible cellular automata with reflective boundary over the prime field of order \(p\)
- The degree of irreversibility in deterministic finite automata
- Cellular automata: descriptional complexity and decidability
- Designing nanoscale counter using reversible gate based on quantum-dot cellular automata
- Fundamentals of reversible flowchart languages
- An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
- Invertible construction of decimal-to-binary converter using reversible elements
- On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
- Cellular automaton supercolliders
- Logically and physically reversible natural computing: a tutorial
- The complexity of translationally invariant spin chains with low local dimension
- Making reversible computing machines in a reversible cellular space
- Clean reversible simulations of ranking binary trees
- Garbageless reversible implementation of integer linear transformations
- The degree of irreversibility in deterministic finite automata
- scientific article; zbMATH DE number 1775519 (Why is no real title available?)
- scientific article; zbMATH DE number 1738656 (Why is no real title available?)
- Cellular automata and artificial life
- One-way reversible multi-head finite automata
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- Queue Automata: Foundations and Developments
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
- General design of reversible sequential machines based on reversible logic elements
- Developments in Language Theory
- Emergence of Complex Phenomena in a Simple Reversible Cellular Space
- scientific article; zbMATH DE number 1775522 (Why is no real title available?)
- Reversible and irreversible computations of deterministic finite-state devices
This page was built for publication: Reversible computing and cellular automata -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924686)
