Abstract
We investigate the dynamics of Elementary Cellular Automata (ECA) under fully asynchronous update with periodic boundary conditions. We tackle the reversibility issue, that is, we want to determine whether, starting from any initial condition, it is possible to go back to this initial condition with random updates. We present analytical tools that allow us to partition the ECA space into three classes: strongly irreversible, irreversible and recurrent.
This work is supported by DST Fast Track Project Fund (No.SR/FTP/ETA-0071/2011).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fatès, N.: A guided tour of asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 15–30. Springer, Heidelberg (2013); An extended version is available from: http://hal.inria.fr/hal-00908373
Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. Journal of Computer and System Sciences 6, 448–464 (1972)
Richardson, D.: Tessellations with local transformations. Journal of Computer Systems and Sciences 6, 373–388 (1972)
Toffoli, T.: Computation and construction universality of reversible cellular automata. Journal of Computer Systems and Sciences 15, 213–231 (1977)
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)
Das, S., Sikdar, B.K.: Characterization of 1-d periodic boundary reversible CA. Electronic Notes in Theoretical Computer Science 252, 205–227 (2009)
Das, S., Sarkar, A., Sikdar, B.K.: Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 643–652. Springer, Heidelberg (2012)
Sarkar, A., Das, S.: On the Reversibility of 1-dimensional Asynchronous Cellular Automata. In: Local Proceedings of Automata 2011, pp. 29–40 (2011), http://hal.inria.fr/hal-00654706
Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Systems 21(1), 71–84 (2012)
Wacker, S., Worsch, T.: On completeness and decidability of phase space invertible asynchronous cellular automata. Fundamenta Informaticae 126(2-3), 157–181 (2013)
Wolfram, S.: Theory and applications of cellular automata. World Scientific, Singapore (1986)
Toffoli, T., Margolus, N.: Invertible cellular automata: A review. Physica D 45(13), 229–253 (1990)
Gajardo, A., Kari, J., Moreira, A.: On time-symmetry in cellular automata. Journal of Computer and Systems Sciences 78(4), 1115–1126 (2012)
Fatès, N.: A note on the classification of the most simple asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 31–45. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Sethi, B., Fatès, N., Das, S. (2014). Reversibility of Elementary Cellular Automata under Fully Asynchronous Update. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol 8402. Springer, Cham. https://doi.org/10.1007/978-3-319-06089-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-06089-7_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06088-0
Online ISBN: 978-3-319-06089-7
eBook Packages: Computer ScienceComputer Science (R0)