2024/11/26 by Subrata Paul, Paul, Subrata, Sukanta Das +1
Computer Science · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #FOS: Computer and information sciences #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL)
paper · pdf · doi:10.48550/arxiv.2411.17421
openalex publication_date 2024/11/26 · openalex created_date 2024/12/05 · openalex updated_date 2026/07/28
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.