March 15, 2013 (v1)
Journal article
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.
Uploaded on: February 28, 2023