Communication complexity and intrinsic universality in cellular automata
From MaRDI portal
Publication:616488
DOI10.1016/J.TCS.2010.10.005zbMATH Open1207.68213OpenAlexW1993589452MaRDI QIDQ616488FDOQ616488
Authors: Pierre Meunier, Ivan Rapaport, Eric Goles, Guillaume Theyssier 
Publication date: 10 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.005
Recommendations
Cites Work
- Endomorphisms and automorphisms of the shift dynamical system
- Title not available (Why is that?)
- Languages, equicontinuity and attractors in cellular automata
- Directional dynamics for cellular automata: A sensitivity to initial condition approach
- Communication Complexity
- On local symmetries and universality in cellular automata
- P-completeness of Cellular Automaton Rule 110
- Inducing an order on cellular automata by a grouping operation
- Cellular automata and communication complexity
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- The two-handed tile assembly model is not intrinsically universal
- Computational complexity of the stability problem for elementary 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
- On factor universality in symbolic spaces
- Simulation of non-uniform cellular automata by classical cellular automata and its application in embedded systems
- Unraveling simplicity in elementary cellular automata
- Communication complexity meets cellular automata: necessary conditions for intrinsic universality
- On the complexity of two-dimensional signed majority cellular automata
- The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
- Building squares with optimal state complexity in restricted active self-assembly
- Intrinsically universal cellular automata
- Title not available (Why is that?)
- Cellular automata with sparse communication
- Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata
- The mirage of universality in cellular automata
- Erratum to: ``Communication complexity and intrinsic universality in cellular automata
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- A brief tour of theoretical tile self-assembly
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- Freezing, bounded-change and convergent cellular automata
- Simulation limitations of affine cellular automata
- Intrinsic universality in automata networks. I: Families and simulations
This page was built for publication: Communication complexity and intrinsic universality in cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616488)
