Amalgamation of cellular automata

Guillaume Theyssier 1, *
Abstract : In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgamation operations (including the well-known families of majority and minority CA), the density of a large class of properties follows a zero-one law. Besides, we establish that intrinsic universality in those families is always non-trivial and undecidable for some of them. Therefore we obtain various syntactical means to produce CA which are almost all intrinsically universal. These results extend properties already obtained for captive cellular automata. We additionally prove that there exists some reversible captive CA which are (intrinsically) universal for reversible CA.
Document type :
Conference papers
Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.182-194, 2008, Regular paper track
Liste complète des métadonnées

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00273999
Contributor : <>
Submitted on : Wednesday, April 16, 2008 - 11:58:58 PM
Last modification on : Thursday, January 11, 2018 - 6:12:26 AM
Document(s) archivé(s) le : Friday, September 28, 2012 - 12:45:52 PM

File

182-194.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-00273999, version 1

Collections

Citation

Guillaume Theyssier. Amalgamation of cellular automata. Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.182-194, 2008, Regular paper track. 〈hal-00273999〉

Share

Metrics

Record views

166

Files downloads

64