A Generic NSRTD Framework for Characterizing Cellular Automaton Rules in Constant (0/1) Boundary Conditions
Som Banerjee Som Banerjee, Mamata Dalui, Suvadip Hazra · Complex Systems · 2024
The cellular automaton (CA) is a rapidly emerging computational model that is widely used in different areas of simulations and scientific applications, as it can solve complex problems using simple rules.Cellular automata (CAs) are largely used in VLSI systems, fault detection, cryptography and other fields.In most of these applications, 2-state 3-neighborhood one-dimensional CAs are used.Some of the work on characterizing elementary CA (ECA) rules has been done, but all such work mainly focuses on a specific boundary condition (i.e., null, periodic boundary).This paper targets the design and development of a generic framework for the next state rule minterm transition diagram (NSRTD), referred to as the generic NSRTD (G-NSRTD), for constant (0/1) boundary conditions.By utilizing the developed G-NSRTD framework, which is reconfigurable based on the chosen boundary condition (constant-0/1), ECA rules can be characterized for both null and constant-1 boundary conditions.Hence, the current paper also focuses on characterizing all 256 ECA rules in constant (0/1) boundary conditions using the developed G-NSRTD framework, leading to the identification of all CA rules forming uniform single length cycle single-attractor CAs (SACAs), single length cycle two-attractor CAs (TACAs) and single length cycle multi-attractor CAs (MACAs) for arbitrary CA length n.Some of the relevant CA theories related to the characterization of ECA rules in constant (0/1) boundary conditions have been developed and reported accordingly.