scientific article; zbMATH DE number 2009869
From MaRDI portal
Publication:4434779
Recommendations
Cited in
(12)- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- 1-bit inter-cell communication cellular algorithms.
- Minimum and non-minimum time solutions to the firing squad synchronization problem
- Problem solving on one-bit-communication cellular automata
- State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata
- scientific article; zbMATH DE number 5190413 (Why is no real title available?)
- scientific article; zbMATH DE number 2013815 (Why is no real title available?)
- scientific article; zbMATH DE number 1738668 (Why is no real title available?)
- On the Synchronisation Problem over Cellular Automata
- scientific article; zbMATH DE number 2153022 (Why is no real title available?)
- The firing squad synchronization problem on CA with multiple updating cycles
- Dynamics and self-organization in one-dimensional arrays
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 Q4434779)