| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427527 | Information Processing Letters | 2013 | 4 Pages |
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.
► A combinatorial proof that surjective D-dimensional CA are non-wandering is given. ► This answers an old open question stated in [2] (see paper references). ► An explicit upper bound for the return time is given.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Luigi Acerbi, Alberto Dennunzio, Enrico Formenti,