Developing NSRTD for 5-Neighborhood Periodic Boundary Cellular Automata
摘要
The 5-neighborhood cellular automaton (CA) has demonstrated significant effectiveness in modeling applications such as cryptography and random number generation, owing to its enhanced randomness and diffusion characteristics derived from the larger neighborhood size. However, most widely used CA characterization tools—such as the Rule Vector Graph (RVG), Explicit Rule Vector Graph (ERVG), Reachability Tree (RT), and Next State RMT Transition Diagram (NSRTD)—have primarily been developed for 3-neighborhood cellular automata (3N CAs). This creates a clear need for tools that can effectively support 5-neighborhood CAs. To address this gap, this paper presents the development of NSRTD framework, specifically designed for 2-state, 5-neighborhood periodic boundary CA (5N PBCA). The proposed framework serves as a potential analytical tool for studying the spatio-temporal behavior of Rule Min Terms (RMTs) in 5N PBCA. Furthermore, algorithms detailing the step-by-step working procedure of the framework have been developed and analyzed. The proposed NSRTD framework effectively accommodates both uniform and nonuniform CAs.