Self-Timed Cellular Automata and their computational ability

DOI10.1016/S0167-739X(02)00069-9MaRDI QIDQ4788329zbMATH OpenOpenAlexFDO

Authors Ferdinand Peper, Teijiro Isokawa, Noriaki Kouda, Nobuyuki Matsui

Publication date 21 January 2003

Published in Future Generation Computer Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-739x(02)00069-9

zbMATH Keywords

Asynchronous Cellular AutomataUniversal computationChain reactionsSelf-timing

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Universal Construction on Self-Timed Cellular Automata
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Delay-insensitive computation in asynchronous cellular automata
• Construction universality in purely asynchronous cellular automata
• Scientific article; zbMATH DE number 2113945

Cited in

(20)

• Universal totalistic asynchonous cellular automaton and its possible implementation by DNA
• Construction universality in purely asynchronous cellular automata
• Direction-reversible self-timed cellular automata for delay-insensitive circuits
• UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
• Molecular implementations of cellular automata
• FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
• Defect-tolerance in cellular nanocomputers
• A defect localization scheme for cellular nanocomputers
• Asynchronous self-reproducing loops with arbitration capability
• Probing robustness of cellular automata through variations of asynchronous updating
• scientific article; zbMATH DE number 1583880 (Why is no real title available?)
• Asynchronous game of life
• Emergence of universal global behavior from reversible local transitions in asynchronous systems
• Universal Construction on Self-Timed Cellular Automata
• scientific article; zbMATH DE number 2113945 (Why is no real title available?)
• An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements
• A game-of-life-based paradigm for massively parallel computing on asynchronous circuits
• On cellular automata rules of molecular arrays
• Self-replicating loops: a survey
• Delay-insensitive computation in asynchronous cellular automata

This page was built for publication: Self-Timed Cellular Automata and their computational ability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4788329)