Back to Search
Start Over
Bulking II: Classifications of cellular automata
- Source :
-
Theoretical Computer Science . Jul2011, Vol. 412 Issue 30, p3881-3905. 25p. - Publication Year :
- 2011
-
Abstract
- Abstract: This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc.) providing several formal tools allowing to classify cellular automata. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 412
- Issue :
- 30
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 60927378
- Full Text :
- https://doi.org/10.1016/j.tcs.2011.02.024