Name
Title | ||
|---|---|---|
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof |
Abstract | ||
|---|---|---|
A combinatorial proof that surjective D-dimensional CA are non-wandering is given. This answers an old open question stated in Blanchard and Tisseur (2000) [3]. Moreover, an explicit upper bound for the return time is given. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ipl.2012.12.009 | Inf. Process. Lett. |
Keywords | Field | DocType |
surjective multidimensional cellular automaton,surjective d-dimensional ca,old open question,return time,combinatorial proof,symbolic dynamics | Symbolic dynamics,Discrete mathematics,Cellular automaton,Combinatorics,Upper and lower bounds,Combinatorial proof,Surjective function,Mathematics | Journal |
Volume | Issue | ISSN |
113 | 5-6 | 0020-0190 |
Citations | PageRank | References |
6 | 0.47 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luigi Acerbi | 1 | 43 | 2.95 |
| alberto dennunzio | 2 | 318 | 38.17 |
| Enrico Formenti | 3 | 400 | 45.55 |