Skip to main content
SpringerLink
Log in

Infinite Snake Tiling Problems

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2450))

Included in the following conference series:

Abstract

Wang tiles are square tiles with colored edges.We investigate the problems of tiling infinite snakes and cycles where neighboring tiles must have identical colors in their adjacent edges. A snake is a non-overlapping sequence of tiles. We show that it is undecidable if such snakes or cycles are possible using copies of tiles from a given finite tile collection.

Research supported by NSF Grant CCR 97-33101 and the Academy of Finland Grant 54102

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman. Towards a mathematical theory of self-assembly. Technical Report 00-722 (2000), Department of Computer Science, University of Southern California.

    Google Scholar 

  2. L. Adleman, J. Kari, L. Kari, D. Reishus. On the decidability of self-asssembly of infinite ribbons. Proceedings of FOCS’2002, 43rd Annual Symposium on Foundations of Computer Science (2002), 530–537.

    Google Scholar 

  3. R. Berger. The undecidability of the domino problem. Mem.Amer.Math.Soc. 66 (1966).

    Google Scholar 

  4. B. Durand. The surjectivity problem for 2D Cellular Automata. Journal of Computer and System Sciences 49 (1994), 149–182.

    Article  MathSciNet  Google Scholar 

  5. Y. Etzion. On the solvability of domino snake problems. MSc. Thesis. Dept. of Applied Math. and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1991.

    Google Scholar 

  6. Y. Etzion-Petruschka, D. Harel, D. Myers. On the solvability of domino snake problems. Theoretical Computer Science 131 (1994), 243–269.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Kari. Reversibility of 2D cellular automata is undecidable. Physica D 54 (1990), 379–385.

    Article  MathSciNet  Google Scholar 

  8. J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences 48 (1994), 149–182.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Myers. Decidability of the tiling connectivity problem. Abstract 79T-E42, Notices Amer. Math. Soc. 195(26) (1979), A–441.

    Google Scholar 

  10. R. M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inven. Math. 12 (1971), 177–209.

    Article  Google Scholar 

  11. H. Wang. Proving theorems by pattern recognition. II. Bell Systems Technical Journal 40 (1961), 1–42.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, FIN-20014, Turku, Finland

    Jarkko Kari

Authors
  1. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kari, J. (2003). Infinite Snake Tiling Problems. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation