Communication complexity and intrinsic universality in cellular automata
type: Item
instance of: scholarly article
title: Communication complexity and intrinsic universality in cellular automata
zbMATH Open document ID: 1207.68213
author: Pierre Meunier
author: Ivan Rapaport
author: Eric Goles
author: Guillaume Theyssier
published in: Theoretical Computer Science
publication date: 2011-01-10T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 37B15
zbMATH DE Number: 5834249
zbMATH Keywords: cellular automata
zbMATH Keywords: communication complexity
zbMATH Keywords: intrinsic universality
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.10.005
OpenAlex ID: W1993589452
cites work: On Local Symmetries and Universality in Cellular Automata
cites work: Q4699286
cites work: Cellular automata and communication complexity
cites work: Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Languages, equicontinuity and attractors in cellular automata
cites work: Communication Complexity
cites work: Inducing an order on cellular automata by a grouping operation
cites work: Q5590814
cites work: P-completeness of Cellular Automaton Rule 110
cites work: Directional dynamics for cellular automata: A sensitivity to initial condition approach
cites work: Q5554352
DOI: 10.1016/J.TCS.2010.10.005
description: scientific article; zbMATH DE number 5834249