Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol

DOI10.1007/978-3-540-92182-0_53zbMath1183.68395OpenAlexW1595947008MaRDI QIDQ3596753

Cedric Little, Ivan Rapaport, Eric Goles Chacc

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_53

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Network protocols (68M12)

Related Items (6)

Unraveling simplicity in elementary cellular automata ⋮ Communication complexity and intrinsic universality in cellular automata ⋮ Communication complexity meets cellular automata: necessary conditions for intrinsic universality ⋮ Traced communication complexity of cellular automata ⋮ Communication complexity in number-conserving and monotone cellular automata ⋮ Eric Goles

This page was built for publication: Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol