Communications in cellular automata

MaRDI QIDQ5145151zbMATH OpenFDO

Authors Pierre Meunier, Ivan Rapaport, Guillaume Theyssier, Eric Goles

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3284, http://eptcs.web.cse.unsw.edu.au/paper.cgi?CSP08.8

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Cellular automata (computational aspects) (68Q80)

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)

• Cellular automata and communication complexity
• Cellular automata with sparse communication
• Eric Goles
• scientific article; zbMATH DE number 6502824 (Why is no real title available?)
• Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
• A study of chaos in cellular automata
• Traced communication complexity of cellular automata
• Communication complexity in number-conserving and monotone cellular automata
• Asynchronous communicating cellular automata: formalization, robustness and equivalence

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)