2000 character limit reached
On reversible asynchronous non-uniform cellular automata (2201.13283v2)
Published 31 Jan 2022 in math.DS, cs.DM, cs.FL, and math.GR
Abstract: We study the class of asynchronous non-uniform cellular automata (ANUCA) over an arbitrary group universe with multiple local transition rules. We introduce the notion of stable injectivity, stable reversibility, stable post-surjectivity and investigate several dynamical properties of such automata. In particular, we establish the equivalence between reversibility, stable reversibility, and stable injectivity for ANUCA. We also prove the invertibility of several classes of injective and stably injective ANUCA. Counter-examples are given to highlight the differences between cellular automata and ANUCA.