Advertisement

Differences Between 2D Neighborhoods According to Real Time Computation

  • Anael GrandjeanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10396)

Abstract

Cellular automata are a parallel model of computation. This paper presents studies about the impact of the choice of the neighborhood on small complexity classes, mainly the real time class. The main result states that given two neighborhoods \(\mathcal {N}\) and \(\mathcal {N}'\), if \(\mathcal {N}\) has a limiting vertex in some direction and \(\mathcal {N}'\) have no vertex in that direction then there is a language recognizable in real time with \(\mathcal {N}'\) and not with \(\mathcal {N}\). One easy corollary is that real time classes for two neighborhoods may be incomparable (and such neighborhoods are easy to construct).

References

  1. 1.
    Choffrut, C., Culik II, K.: On real-time cellular automata and trellis automata. Acta Inf. 21, 393–407 (1984). http://dx.doi.org/10.1007/BF00264617 MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Delacourt, M., Poupet, V.: Real time language recognition on 2D cellular automata: dealing with non-convex neighborhoods. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 298–309. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-74456-6_28 CrossRefGoogle Scholar
  3. 3.
    Grandjean, A.: Constant acceleration theorem for extended von neumann neighbourhoods. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 149–158. Springer, Cham (2016). doi: 10.1007/978-3-319-39300-1_12 Google Scholar
  4. 4.
    Kutrib, M., Malcher, A.: Transductions computed by iterative arrays. Journees Automates Cellulaires 2010, 156–167 (2010)Google Scholar
  5. 5.
    von Neumann, J.: Theory of Self-reproducing Automata. University of Illinois Press, Urbana (1966)Google Scholar
  6. 6.
    Poupet, V.: Cellular automata: real-time equivalence between one-dimensional neighborhoods. In: Proceedings of STACS 2005, pp. 133–144 (2005)Google Scholar
  7. 7.
    Smith III, A.R.: Simple computation-universal cellular spaces. J. ACM 18(3), 339–353 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Terrier, V.: Two-dimensional cellular automata recognizer. Theor. Comput. Sci. 218, 325–346 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Terrier, V.: Two-dimensional cellular automata and their neighborhoods. Theor. Comput. Sci. 312, 203–222 (2004)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.LIRMM, Université de MontpellierMontpellierFrance

Personalised recommendations