Leader election on two-dimensional periodic cellular automata - GREYC amacc Access content directly
Journal Articles Theoretical Computer Science Year : 2017

Leader election on two-dimensional periodic cellular automata

Nicolas Bacquey

Abstract

This article explores the computational power of bi-dimensional cellular au-tomata acting on periodical configurations. It extends in some sense the results of a similar paper dedicated to the one-dimensional case. More precisely, we present an algorithm that computes a " minimal pattern network " , i.e. a minimal pattern and the two translation vectors it can use to tile the entire configuration. This problem is equivalent to the computation of a leader, which is one equivalence class of the cells of the periodical configuration.
Fichier principal
Vignette du fichier
CyclicCADimension2.pdf (370.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01178250 , version 1 (17-07-2015)
hal-01178250 , version 2 (22-09-2017)

Identifiers

Cite

Nicolas Bacquey. Leader election on two-dimensional periodic cellular automata. Theoretical Computer Science, 2017, 659, pp.36-52. ⟨10.1016/j.tcs.2016.10.021⟩. ⟨hal-01178250v2⟩
102 View
162 Download

Altmetric

Share

Gmail Facebook X LinkedIn More