Communications in cellular automata
From MaRDI portal
Publication:5145151
Recommendations
- scientific article; zbMATH DE number 6502824
- Traced communication complexity of cellular automata
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- Communication complexity in number-conserving and monotone cellular automata
- Cellular automata and communication complexity
Cited in
(9)- Traced communication complexity of cellular automata
- Communication complexity in number-conserving and monotone cellular automata
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- Eric Goles
- Cellular automata with sparse communication
- A study of chaos in cellular automata
- scientific article; zbMATH DE number 6502824 (Why is no real title available?)
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- Cellular automata and communication complexity
This page was built for publication: Communications in cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145151)