Abstract
This paper reports characterization of reachable/nonreachable states of 3-neighborhood non-homogeneous Cellular Automata (CA). An efficient scheme to identify nonreachable states in O(n) time is proposed. It also computes the number of such states in O(n) time. The reported characterization of nonreachable states provides the theoretical background to identify and synthesize a reversible CA in linear time. © Springer-Verlag 2004.
Cite
CITATION STYLE
Das, S., Sikdar, B. K., & Pal Chaudhuri, P. (2004). Characterization of reachable/nonreacliable cellular automata states. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3305, 813–822. https://doi.org/10.1007/978-3-540-30479-1_84
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
