scientific article; zbMATH DE number 1738656
From MaRDI portal
Publication:4529993
zbMATH Open0984.68512MaRDI QIDQ4529993FDOQ4529993
Authors: Kenichi Morita 
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2055/20550102
Title of this publication is not available (Why is that?)
Recommendations
Cited In (29)
- Title not available (Why is that?)
- 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?
- On the Persistency of Gellular Automata
- Reversible computing and cellular automata -- a survey
- Title not available (Why is that?)
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Novel Reversible Logic Elements for Unconventional Computing
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Defect-tolerance in cellular nanocomputers
- Delay-insensitive computation in asynchronous cellular automata
- An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
- An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
- Construction universality in purely asynchronous cellular automata
- Invertible construction of decimal-to-binary converter using reversible elements
- Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata
- On DNA-based gellular automata
- Title not available (Why is that?)
- A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
- Making reversible computing machines in a reversible cellular space
- Clean reversible simulations of ranking binary trees
- Machines, Computations, and Universality
- Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
- Turing-completeness of asynchronous non-camouflage cellular automata
- An instruction set for reversible Turing machines
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- General design of reversible sequential machines based on reversible logic elements
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
- Theory of reversible computing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529993)
