Title
Computational complexity of rule distributions of non-uniform cellular automata
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.
Year
DOI
Venue
2012
10.1007/978-3-642-28332-1_18
Lecture Notes in Computer Science
Keywords
Field
DocType
initial rough classification,rule distribution,spatial distribution,bi-infinite word,cellular automaton,non-uniform cellular automaton,complexity class,interesting property,computational complexity,different local rule,local rule
Complexity class,Discrete mathematics,Cellular automaton,Combinatorics,Lattice (order),Computer science,Algorithm,Computational complexity theory
Conference
Citations 
PageRank 
References 
4
0.56
13
Authors
3
Name
Order
Citations
PageRank
alberto dennunzio131838.17
Enrico Formenti240045.55
Julien Provillard3516.08