Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Neumann, J.V.: The Theory of Self Reproducing Automata. In: Burks, A.W. (ed.), Univ. of Illinois Press, Urbana and London (1996)
Wolfram, S.: Statistical Mechanics of Cellular Automata. Rev. Mod. Phys. 55, 601–644 (1983)
Martin, O., Odlyzko, A.M., Wolfram, S.: Algebraic properties of cellular automata. Commun. Math. Phys. 93, 219–258 (1984)
Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI application. IEEE Trans. Comput. 12, 1013–1024 (1986)
Chaudhuri, P.P., Choudhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications. IEEE Computer Society Press, USA (1997)
Wuensche, A.: Attractor Basins of Discrete Networks. Cognitive Science Research Paper, The University of Sussex (1997)
Das, S., Sikdar, B.K., Chaudhuri, P.P.: Characterization of Reachable/Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 813–822. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, BH., Jeon, JC., Yoo, KY. (2006). Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_15
Download citation
DOI: https://doi.org/10.1007/11861201_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40929-8
Online ISBN: 978-3-540-40932-8
eBook Packages: Computer ScienceComputer Science (R0)