Complexity-Theoretic Aspects of Expanding Cellular Automata

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11525)


The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. The respective polynomial-time complexity class is shown to coincide with Open image in new window , that is, the class of decision problems polynomial-time truth-table reducible to problems in Open image in new window . Corollaries on select XCA variants are proven: XCAs with multiple accept and reject states are shown to be polynomial-time equivalent to the original XCA model. Meanwhile, XCAs with diverse acceptance behavior are classified in terms of Open image in new window and the Turing machine polynomial-time class Open image in new window .



The author would like to thank Thomas Worsch for his mentoring, encouragement, and support during the writing of this paper. The author would also like to thank Dennis Hofheinz for pointing out a crucial mistake in a preliminary version of this paper as well as the anonymous referees for their valuable remarks and suggestions.


  1. 1.
    Arrighi, P., Dowek, G.: Causal graph dynamics. Inf. Comput. 223, 78–93 (2013)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Buss, S.R., Hay, L.: On truth-table reducibility to SAT. Inf. Comput. 91(1), 86–102 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, Shaker Heights, Ohio, USA, pp. 151–158. ACM (1971)Google Scholar
  4. 4.
    Dantchev, S.S.: Dynamic neighbourhood cellular automata. In: Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22–24 September 2008, pp. 60–68 (2008)Google Scholar
  5. 5.
    Dubacq, J.-C.: Different kinds of neighborhood-varying cellular automata. Maîtrise/honour bachelor degree, École normale superiéure de Lyon (1994)Google Scholar
  6. 6.
    Ibarra, O.H., et al.: Fast parallel language recognition by cellular automata. Theor. Comput. Sci. 41, 231–246 (1985)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Ilachinski, A., Halpern, P.: Structurally dynamic cellular automata. Complex Syst. 1(3), 503–527 (1987)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Kim, S., McCloskey, R.: A characterization of constant-time cellular automata computation. Physica D 45(1–3), 404–419 (1990)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kutrib, M.: Cellular automata and language theory. In: Encyclopedia of Complexity and Systems Science, pp. 800–823 (2009)CrossRefGoogle Scholar
  10. 10.
    Kutrib, M., Malcher, A., Wendlandt, M.: Shrinking one-way cellular automata. In: Kari, J. (ed.) AUTOMATA 2015. LNCS, vol. 9099, pp. 141–154. Springer, Heidelberg (2015). Scholar
  11. 11.
    Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Math. Syst. Theory 10, 19–32 (1976)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Ladner, R.E., et al.: A comparison of polynomial time reducibilities. Theor. Comput. Sci. 1(2), 103–123 (1975)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Modanese, A.: Complexity-theoretical aspects of expanding cellular automata. Master’s thesis, Karlsruhe Institute of Technology (2018)Google Scholar
  14. 14.
    Modanese, A.: Shrinking and expanding one-dimensional cellular automata. Bachelor’s thesis, Karlsruhe Institute of Technology (2016)Google Scholar
  15. 15.
    Modanese, A., Worsch, T.: Shrinking and expanding cellular automata. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 159–169. Springer, Cham (2016). Scholar
  16. 16.
    Rosenfeld, A.: Picture Languages. Academic Press, New York (1979)zbMATHGoogle Scholar
  17. 17.
    Rosenfeld, A., Wu, A.Y.: Reconfigurable cellular computers. Inf. Control 50(1), 60–84 (1981)CrossRefGoogle Scholar
  18. 18.
    Rosenfeld, A., et al.: Fast language acceptance by shrinking cellular automata. Inf. Sci. 30(1), 47–53 (1983)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Smith III, A.R.: Simple computation-universal cellular spaces. J. ACM 18(2), 339–353 (1971)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Sommerhalder, R., van Westrhenen, S.C.: Parallel language recognition in constant time by cellular automata. Acta Inf. 19, 397–407 (1983)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Tomita, K., et al.: Graph automata: natural expression of self-reproduction. Phys. D: Nonlinear Phenom. 171(4), 197–210 (2002)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Wagner, K.W.: Bounded query classes. SIAM J. Comput. 19(5), 833–846 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2019

Authors and Affiliations

  1. 1.Institute of Theoretical Informatics (ITI)Karlsruhe Institute of Technology (KIT)KarlsruheGermany

Personalised recommendations