Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition
Das et al. have reported characterization of reachable/non-reachable CA states recently. Their scheme has only offered the characterization under a null boundary CA (NBCA). However, in hardware implementation, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register structure because of its circular property. Thus, this paper provides two decision algorithms for classification of reachable/non-reachable state and group/non-group CA based on periodic boundary condition.
KeywordsPeriodic Boundary Condition Cellular Automaton Cellular Automaton Decision Algorithm Reachable State
Unable to display preview. Download preview PDF.