Tilings Robust to Errors

  • Alexis Ballier
  • Bruno Durand
  • Emmanuel Jeandel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6034)


We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the objects we obtain close to an error-free tiling of the plane?

We prove that tilesets that produce only periodic tilings are robust to errors. For this proof, we use a hierarchical construction of islands of errors (see [6,7]). We also show that another class of tilesets, those that admit countably many tilings is not robust and that there is no computable way to distinguish between these two classes.


Turing Machine Local Constraint Periodic Tiling Aperiodic Tiling Wang Tile 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ballier, A., Durand, B., Jeandel, E.: Structural aspects of tilings. In: 25th International Symposium on Theoretical Aspects of Computer Science, STACS (2008)Google Scholar
  2. 2.
    Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society 66 (1966)Google Scholar
  3. 3.
    Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Cervelle, J., Durand, B.: Tilings: recursivity and regularity. Theoretical computer science 310(1-3), 469–477 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Durand, B., Levin, L.A., Shen, A.: Complex Tilings. In: STOC, pp. 732–739 (2001)Google Scholar
  6. 6.
    Durand, B., Romashchenko, A.E.: On stability of computations by cellular automata. In: European Conference on Complex Systems (2005)Google Scholar
  7. 7.
    Durand, B., Romashchenko, A.E., Shen, A.: Fixed point and aperiodic tilings. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 276–288. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Durand, B., Romashchenko, A.E., Shen, A.: High complexity tilings with sparse errors. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 403–414. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Gacs, P.: Reliable cellular automata with self-organization. J. of Stat.Phys., 103 (2001)Google Scholar
  10. 10.
    Gurevich, Y., Koriakov, I.: A remark on Berger’s paper on the domino problem. Siberian Journal of Mathematics 13, 459–463 (1972) (in Russian)zbMATHGoogle Scholar
  11. 11.
    Hanf, W.P.: Nonrecursive tilings of the plane. i. J. Symb. Log. 39(2), 283–285 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Lind, D.A.: Multidimensional Symbolic Dynamics. In: Symbolic dynamics and its applications. In: Proceedings of Symposia in Applied Mathematics, vol. 11, pp. 61–80 (2004)Google Scholar
  13. 13.
    Lind, D.A., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, New York (1995)zbMATHCrossRefGoogle Scholar
  14. 14.
    Myers, D.: Nonrecursive tilings of the plane. ii. J. Symb. Log. 39(2), 286–294 (1974)zbMATHCrossRefGoogle Scholar
  15. 15.
    Ollinger, N.: Two-by-two substitution systems and the undecidability of the domino problem. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 476–485. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  16. 16.
    Radin, C.: Global order from local sources. Bulletin of the American Mathematical Society 25, 335–364 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Radin, C.: ℤn versus ℤ actions for systems of finite type. Contemporary Mathematics 135, 339–342 (1992)MathSciNetGoogle Scholar
  18. 18.
    Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 293–307. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177–209 (1971)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal 40, 1–41 (1961)Google Scholar
  21. 21.
    Wang, H.: Dominoes and the ∀ ∃ ∀ case of the decision problem. In: Mathematical theory of Automata, pp. 23–55 (1963)Google Scholar
  22. 22.
    Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 126–144. Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alexis Ballier
    • 1
  • Bruno Durand
    • 1
  • Emmanuel Jeandel
    • 1
  1. 1.Laboratoire d’informatique fondamentale de Marseille (LIF)Aix-Marseille Université, CNRSMarseille Cedex 13France

Personalised recommendations