A note on asynchronous cellular automata
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3742643 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3338162 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- A Combinatorial Approach to Self-Correction
- Cell space approaches in biomathematics
- ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
- Overlapping algorithms
- Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
- Simple Computation-Universal Cellular Spaces
- Towards a Theory of Universal Speed-Independent Modules
Cited in
(6)- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Delay-insensitive computation in asynchronous cellular automata
- Construction universality in purely asynchronous cellular automata
- A comprehensive taxonomy of cellular automata
- Modular implementation of concurrency
- FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
This page was built for publication: A note on asynchronous cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253544)