On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View

  • Nazim Fatès
  • Biswanath Sethi
  • Sukanta Das
Part of the Emergence, Complexity and Computation book series (ECC, volume 30)


The reversibility of classical cellular automata is now a well-studied topic but what is reversibility when the evolution of the system is stochastic? In this context, we study a particular form of reversibility: the possibility of returning infinitely often to the initial condition after a random number of time steps. This corresponds to the recurrence property of the system. We analyse this property for the 256 elementary cellular automata with a finite size and a fully asynchronous updating, that is, we update only one cell, randomly chosen, at each time step. We show that there are 46 recurrent rules which almost surely come back to their initial condition. We analyse the structure of the communication graph of the system and find that the number of the communication classes may have different scaling laws, depending on the active transitions of the rules (those for which the state of the cell is modified when an update occurs).



The authors have benefitted from the careful reading of the manuscript by Jordina Francès de Mas and from helpful remarks of the reviewers.


  1. 1.
    Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comput. Syst. Sci. 6, 448–464 (1972)CrossRefzbMATHGoogle Scholar
  2. 2.
    Das, S., Sarkar, A., Sikdar, B.K.: Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Proceedings of ACRI’12, pp. 643–652. Springer (2012)Google Scholar
  3. 3.
    Fatès, N.: A guided tour of asynchronous cellular automata. J. Cell. Autom. 9, 387–416 (2014)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Morita, K.: Reversible computing and cellular automata – a survey. Theor. Comput. Sci. 395(1), 101–131 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Richardson, D.: Tessellations with local transformations. J. Comput. Syst. Sci. 6, 373–388 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21(1), 71–84 (2012)MathSciNetGoogle Scholar
  7. 7.
    Sethi, B., Fatès, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal, T.V., Agrawal, M., Li, A., Barry Cooper, S. (eds.) Proceedings of TAMC 2014. Lecture Notes in Computer Science, vol. 8402, pp. 39–49. Springer (2014)Google Scholar
  8. 8.
    Schüle, M., Stoop, R.: A full computation-relevant topological dynamics classification of elementary cellular automata. Chaos 22(4), 043143 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15, 213–231 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Wacker, S., Worsch, T.: On completeness and decidability of phase space invertible asynchronous cellular automata. Fundamenta Informaticae 126(2–3), 157–181 (2013)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Inria Nancy, LORIAUniversité de LorraineNancyFrance
  2. 2.Indira Gandhi Institute of Technology, SarangDhenkanalIndia
  3. 3.Indian Institute of Engineering Science and Technology, ShibpurHowrahIndia

Personalised recommendations