Communications in cellular automata

zbMATH Open1455.68109arXiv0906.3284MaRDI QIDQ5145151FDOQ5145151

Guillaume Theyssier, Pierre Meunier, Ivan Rapaport, Eric Goles

Publication date: 20 January 2021

Full work available at URL: https://arxiv.org/abs/0906.3284

Recommendations

• scientific article
• 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

Mathematics Subject Classification ID

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

Cited In (6)

• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• Title not available (Why is that?)
• Cellular automata and communication complexity
• Cellular automata with sparse communication
• Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
• Eric Goles

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)