An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 2013811 (Why is no real title available?)
- scientific article; zbMATH DE number 1738656 (Why is no real title available?)
- Conservative logic
- Generating the group of reversible logic gates
- Logical Reversibility of Computation
- Self-Timed Cellular Automata and their computational ability
Cited in
(9)- Reconfigurable asynchronous logic automata (RALA)
- 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?
- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?
- Invertible construction of decimal-to-binary converter using reversible elements
- Reversible delay-insensitive distributed memory modules
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- 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
This page was built for publication: An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541745)