ν-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.
Dennunzio, A., Formenti, E., Provillard, J. (2012). Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. In Language and Automata Theory and Applications (pp.204-215) [10.1007/978-3-642-28332-1_18].
Computational Complexity of Rule Distributions of Non-uniform Cellular Automata
DENNUNZIO, ALBERTO;
2012
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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
