Computational Complexity of Rule Distributions of Non-uniform Cellular AutomataReportar como inadecuado




Computational Complexity of Rule Distributions of Non-uniform Cellular Automata - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* Corresponding author 1 Università degli studi di Milano Milano 2 I3S - Laboratoire d-Informatique, Signaux, et Systèmes de Sophia Antipolis 3 MDSC - Modèles Discrets pour les Systèmes Complexes

Abstract : ν-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.





Autor: Alberto Dennunzio - Enrico Formenti - Julien Provillard -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados