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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Dennunzio, A., Formenti, E., & Provillard, J. (2012). Computational complexity of rule distributions of non-uniform cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 204–215). https://doi.org/10.1007/978-3-642-28332-1_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
