This paper solves the problem of determining the number of cells in an invertible three neighborhood null-boundary uniform cellular automaton (CA) by using its rule vector graph (RVG). The RVG represents an efficient data structure designed to characterize CA evolution and is derived out of its rule vector (RV). The concept of a horizontal rule vector subgraph (HRVS) is introduced to formulate the analytical framework of the solution. The RVG of a CA is partitioned into a number of identical HRVSs. It has been shown that invertible CA size depends on the size of the HRVS.
Abstract. Theory and application of Cellular automata (CA) as a global Transform for detecting compositeness of a number is reported. To test an n bit odd valued number N in the range 2 n−1 to (2 n -1), a Compositeness Detecting CA (CDCA) set is designed with N = S as a Self Loop Attractor (SLA) State, where S = S × S , S is the largest factor of S, S = 3,5,7,· · · . The set has at least one CDCA with the state S in its attractor basin; the CA initialized with S reaches the attractor S after S time steps. A number is detected as a prime if no CDCA is synthesized.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.