Cellular Automata and Discrete Geometry - Archive ouverte HAL
Communication Dans Un Congrès Année : 2011

Cellular Automata and Discrete Geometry

Résumé

In this paper, we look at the possibility to implement the algorithm to construct a discrete line devised by the first author in cellular automata. It turns out that such an implementation is feasible.
Fichier non déposé

Dates et versions

hal-00610383 , version 1 (21-07-2011)

Identifiants

  • HAL Id : hal-00610383 , version 1

Citer

Isabelle Debled-Rennesson, Maurice Margenstern. Cellular Automata and Discrete Geometry. CAAA 2011, Jul 2011, Istanbul, Turkey. pp.333. ⟨hal-00610383⟩
47 Consultations
0 Téléchargements

Partager

More