Characterization of Maximal Length Cellular Automata Using NSRTD
Complex Systems · 2026-06-15 · 35 (2) · 141-160
DOI: 10.25088/complexsystems.35.2.141 ↗At a glance
Journal article in Complex Systems, published online on 2026-06-15. Written by Som Banerjee and 1 co-authors.
Abstract (original language)
Maximal length cellular automata (CAs) have gained significant attention from researchers due to their applications in different areas like random number generation, cryptography and test pattern generation. This paper reports the theoretical framework of the next state rule min term transition diagram (NSRTD) for the characterization of maximal length CAs in null-boundary condition. The proposed solution helps in verifying whether a given cellular automaton (CA) is a maximal length CA or not in O(2n) time. Also, the proposed solution can identify and eliminate a CA candidate that fails to configure a maximal length CA in linear time.
Cite
APA
Banerjee, S., & Dalui, M. (2026). Characterization of Maximal Length Cellular Automata Using NSRTD. Complex Systems, 35(2), 141-160. https://doi.org/10.25088/complexsystems.35.2.141
Vancouver
Banerjee S, Dalui M. Characterization of Maximal Length Cellular Automata Using NSRTD. Complex Systems. 2026;35(2):141-160. doi:10.25088/complexsystems.35.2.141
BibTeX
@article{Banerjee2026,
author = {Banerjee, Som and Dalui, Mamata},
title = {Characterization of Maximal Length Cellular Automata Using NSRTD},
journal = {Complex Systems},
year = {2026},
volume = {35},
number = {2},
pages = {141--160},
doi = {10.25088/complexsystems.35.2.141}
}
EUVIMED