Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
This work addresses theoretical properties of a variant of cellular automata, which is incremental and primarily of interest to researchers in computational theory and dynamical systems.
The paper tackles the problem of analyzing surjectivity, injectivity, reversibility, and cyclic behavior in one-dimensional temporally non-uniform cellular automata (t-NUCAs) that use two rules in sequence, under both finite and infinite lattices, but does not report concrete numerical results.
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.