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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2013, 504, pp.38-51. <10.1016/j.tcs.2012.05.013>


https://hal.archives-ouvertes.fr/hal-01297610
Contributeur : Julien Provillard <>
Soumis le : lundi 4 avril 2016 - 15:15:28
Dernière modification le : samedi 9 avril 2016 - 17:54:18
Document(s) archivé(s) le : mardi 5 juillet 2016 - 15:00:47

Fichier

TCS_2013.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Partager

Métriques

Consultations de
la notice

56

Téléchargements du document

17