This paper targets characterization of the non-reachable states of 1-dimensional irreversible cellular automata (CA). A theoretical framework has been developed to design algorithms for computing the number of non-reachable states as well as the number of single cycle attractors of such a CA. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Das, S., & Sikdar, B. K. (2008). Characterization of non-reachable states in irreversible CA state space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5191 LNCS, pp. 160–167). https://doi.org/10.1007/978-3-540-79992-4_21
Mendeley helps you to discover research relevant for your work.