scientific article; zbMATH DE number 1738656
From MaRDI portal
Publication:4529993
zbMath0984.68512MaRDI QIDQ4529993
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2055/20550102
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior ⋮ Construction universality in purely asynchronous cellular automata ⋮ Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata ⋮ Defect-tolerance in cellular nanocomputers ⋮ How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? ⋮ On DNA-Based Gellular Automata ⋮ Invertible Construction of Decimal-to-Binary Converter Using Reversible Elements ⋮ Clean Reversible Simulations of Ranking Binary Trees ⋮ On the Persistency of Gellular Automata ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Reversible computing and cellular automata -- a survey ⋮ An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements ⋮ Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata ⋮ 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 ⋮ Sequential and maximally parallel multiset rewriting: reversibility and determinism ⋮ Delay-insensitive computation in asynchronous cellular automata ⋮ Turing-completeness of asynchronous non-camouflage cellular automata ⋮ General design of reversible sequential machines based on reversible logic elements ⋮ An instruction set for reversible Turing machines ⋮ Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements
This page was built for publication:
