Automates cellulaires : dynamiques, simulations, traces

Abstract : A cellular automaton is a discrete dynamical system which can model objects that evolve parallelly and asynchronously : the space is divided into cells, each of which has a state evolving according to some single local rule and a finite number of neighboring cells. Though this system can easily be formalized, very complex behaviors can appear ; it turns out to be a powerful computational model. That complexity can be studied with respect to various theories : topology, measure, decidability, information...We adopt here an approach bases on symbolic dynamics, linked to the topology and to the study of shifts of infinite words (suppression of their first letter). To each cellular automaton can be associated its trace subshift, the set of infinite words that represent the sequence of successive states taken by the central cell or some group of central cells. We then have a topological factorisation : reading a letter in one of these words correspond to applying a step of evolution of the automaton
Keywords : Sous-shift Simulation
Document type :
Theses
Complete list of metadatas

Cited literature [135 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00432058
Contributor : Abes Star <>
Submitted on : Friday, November 13, 2009 - 3:52:15 PM
Last modification on : Friday, May 10, 2019 - 1:44:06 PM
Long-term archiving on : Tuesday, October 16, 2012 - 2:01:09 PM

File

2008PEST0215_0_1.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00432058, version 1

Citation

Pierre Guillon. Automates cellulaires : dynamiques, simulations, traces. Informatique [cs]. Université Paris-Est, 2008. Français. ⟨NNT : 2008PEST0215⟩. ⟨tel-00432058⟩

Share

Metrics

Record views

820

Files downloads

578