Characterization of Maximal Length Cellular Automata Using NSRTD

2026/06/15 by S. Banerjee, Som Banerjee, Mamata Dalui
Computer Science · Mathematics · #Cellular Automata and Applications #Stochastic processes and statistical mechanics #Quantum-Dot Cellular Automata

paper · pdf · doi:10.25088/complexsystems.35.2.141

Abstract

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.

Related

• Maximal Length Cellular Automata : A Survey
• Synthesis of all Maximum Length Cellular Automata of Cell Size up to 12
• Issues on drawing the State Transition Diagram for arbitrary Cellular Automata
• Investigation of Rule 73 as Case Study of Class 4 Long-Distance Cellular Automata
• Classification of Cellular Automata Rules Based on Their Properties