Four states are enough!
type: Item
instance of: scholarly article
title: Four states are enough!
zbMATH Open document ID: 1207.68217
published in: Theoretical Computer Science
publication date: 2011-01-10T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 5834250
zbMATH Keywords: cellular automata
zbMATH Keywords: intrinsic universality
zbMATH Keywords: bulking
zbMATH Keywords: particles and collisions
author: Nicolas Ollinger
author: Gaétan Richard
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.08.018
OpenAlex ID: W1966065489
cites work: Q5615059
cites work: Tutorial on Cellular Automata
cites work: Simple Computation-Universal Cellular Spaces
cites work: Q3944542
cites work: Q3802629
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Tesselations with local transformations
cites work: Theory of cellular automata: a survey
cites work: Bulking I: An abstract theory of bulking
cites work: Bulking II: Classifications of cellular automata
cites work: Q4418687
cites work: Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
cites work: Q4737167
cites work: Q5321501
cites work: Q3150942
cites work: Upper bound on the products of particle interactions in cellular automata
cites work: P-completeness of Cellular Automaton Rule 110
DOI: 10.1016/J.TCS.2010.08.018
Recommended article: Four and more
Recommended article: One Is Enough!
Recommended article: Two states
Recommended article: Q3629230
Recommended article: Q5708185
Recommended article: Four heads are better than three
Recommended article: Q3369882
Recommended article: Carleman's Inequality
Recommended article: State will do
description: scientific article; zbMATH DE number 5834250