Local rule distributions, language complexity and non-uniform cellular automata

Abstract : This paper investigates a variant of cellular automata, namely ν-CA. Indeed, ν-CA are cellular automata which can have dierent local rules at each site of their lattice. The assignment of local rules to sites of the lattice completely characterizes ν-CA. In this paper, sets of assignments sharing some interesting properties are associated with languages of bi-innite words. The complexity classes of these languages are investigated providing an initial rough classica-tion of ν-CA.
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01297610
Contributor : Julien Provillard <>
Submitted on : Monday, April 4, 2016 - 3:15:28 PM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM
Document(s) archivé(s) le : Tuesday, July 5, 2016 - 3:00:47 PM

File

TCS_2013.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alberto Dennunzio, Enrico Formenti, Julien Provillard. Local rule distributions, language complexity and non-uniform cellular automata. Theoretical Computer Science, Elsevier, 2013, 504, pp.38-51. ⟨10.1016/j.tcs.2012.05.013⟩. ⟨hal-01297610⟩

Share

Metrics

Record views

313

Files downloads

45