Abstract
This paper reports characterization of 1-D cellular automata (CA) state space to count the cycles of reversible CA. The reachability tree provides theoretical framework to identify number of cycles in reversible CA. However, we concentrate here on a special class of reversible CA that follow right independence property. The right independence property implies, the cells of CA are independent of right neighbor. To our knowledge, no work till now has been done to find the number cycles of reversible CA by analyzing the CA state space.
Keywords
- Reversible celular automata
- cycle
- reachability tree
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata – Theory and Applications, vol. 1. IEEE Computer Society Press, California (1997) ISBN 0-8186-7717-1
Das, S.: Theory and Applications of Nonlinear Cellular Automata In VLSI Design. PhD thesis, Bengal Engineering And Science University, Shibpur, West Bengal, India 711103 (2006)
Das, S., Sikdar, B.K.: Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 68–77. Springer, Heidelberg (2006)
Ganguly, N.: Cellular Automata Evolution: Theory and Applications in Pattern Recognition and Classification. PhD thesis, Bengal Engineering College (a Deemed University), India (2004)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)
Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, S., Chakraborty, A., Sikdar, B.K. (2012). Counting Cycles in Reversible Cellular Automata. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)
