Surjective multidimensional cellular automata are non-wandering: A combinatorial proof

0.00 Avg rating—0 Votes

Article ID:	iaor20131382
Volume:	113
Issue:	5-6
Start Page Number:	156
End Page Number:	159
Publication Date:	Mar 2013
Journal:	Information Processing Letters
Authors:	Acerbi Luigi, Dennunzio Alberto, Formenti Enrico
Keywords:	combinatorial analysis

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.

Reviews

Required fields are marked *. Your email address will not be published.