📝 SummarXiv

Abstract

This work studies Temporally Non-Uniform Cellular Automata (t-NUCAs), a variant of non-uniform cellular automata, which temporally use two rules in a sequence during their evolution. The one-dimensional t-NUCAs, under finite as well as infinite lattices, are considered in this work. Surjectivity and injectivity of the t-NUCAs are studied. The reversibility of the t-NUCAs is also explored here. Finally, a study on the cyclic behavior of finite t-NUCAs is presented.