Name
Abstract | ||
|---|---|---|
This paper investigates a variant of cellular automata, namely @n-CA. Indeed, @n-CA are cellular automata which can have different local rules at each site of their lattice. The assignment of local rules to sites of the lattice completely characterizes @n-CA. In this paper, sets of assignments 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 @n-CA. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.tcs.2012.05.013 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
initial rough classification,bi-infinite word,cellular automaton,non-uniform cellular automaton,local rule distribution,language complexity,complexity class,interesting property,different local rule,local rule | Journal | 504, |
ISSN | Citations | PageRank |
0304-3975 | 7 | 0.47 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| alberto dennunzio | 1 | 318 | 38.17 |
| Enrico Formenti | 2 | 400 | 45.55 |
| Julien Provillard | 3 | 51 | 6.08 |