Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
Formal Languages and Automata Theory
2026-03-24 v3 Cellular Automata and Lattice Gases
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.
Cite
@article{arxiv.2411.17421,
title = {Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior},
author = {Subrata Paul and Sukanta Das},
journal= {arXiv preprint arXiv:2411.17421},
year = {2026}
}