Computational Complexity of Rule Distributions of Non-uniform Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Computational Complexity of Rule Distributions of Non-uniform Cellular Automata

Résumé

ν-CA are cellular automata which can have different local rules at each site of their lattice. Indeed, the spatial distribution of local rules completely characterizes ν-CA. In this paper, sets of distributions sharing some interesting properties are associated with languages of bi-infinite words. The complexity classes of these languages are investigated providing an initial rough classification of ν-CA.
Fichier principal
Vignette du fichier
LATA_2012.pdf (445.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01297574 , version 1 (04-04-2016)

Identifiants

Citer

Alberto Dennunzio, Enrico Formenti, Julien Provillard. Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. Language and Automata Theory and Application, Mar 2012, Coruna, Spain. pp.204-215, ⟨10.1007/978-3-642-28332-1_18⟩. ⟨hal-01297574⟩
102 Consultations
97 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More