Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Simulations d'automates cellulaires

Abstract : This report consists in two main parts. The first deals with the simulation of cellular automata by different models of parallel computation : PRAM, XPRAM and spatial machines. We thus obtain new proofs of the universality of these models based on cellular automata. We draw some conclusions from these results from the point of view of computability and complexity. In the second part, we consider cellular automata defined on finite Cayley graphs.We point out the simulation of Róka which allows to mimic the operation of a hexagonal torus of automata by a torus of automata of dimension two. We describe then various manners of embedding a torus of automata of dimension two in a ring of automata. We deduce from these results the simulation of torus of finite dimension by a ring of automata and that of a hexagonal torus of automata by a ring of automata.
Document type :
Habilitation à diriger des recherches
Complete list of metadata
Contributor : Estelle Nivault <>
Submitted on : Tuesday, January 22, 2008 - 1:49:16 PM
Last modification on : Monday, October 12, 2020 - 10:30:21 AM
Long-term archiving on: : Friday, November 25, 2016 - 8:21:16 PM


  • HAL Id : tel-00212057, version 1



Bruno Martin. Simulations d'automates cellulaires. Mathématiques [math]. Université Nice Sophia Antipolis, 2005. ⟨tel-00212057⟩



Record views


Files downloads