Preview
Unable to display preview. Download preview PDF.
References
S. Beatty, Problem 3173, Am. Math. Monthly 33 (1926) 159; solutions in 34, 159 (1927).
R. Berger, The Undecidability of the Domino Problem, Mem. Amer. Math. Soc. 66 (1966).
K. Culik II, An aperiodic set of 13 Wang tiles, Discrete Mathematics, to appear.
K. Culik II, L. P. Hurd and S. Yu, computation theoretic aspects of cellular automata, Physica D 45, 357–378 (1990).
K. Culik II and S. Yu, Cellular automata, ww-regular sets, and Sofic Systems, Discrete Applied Mathematics 32, 85–102 (1991).
J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).
K. Culik II and J. Kari, An aperiodic set of Wang cubes, Journal of Universal Computer Science 1, 675–686 (1995).
B. Grünbaum and G.C. Shephard, Tilings and Patterns, W.H.Freeman and Company, New York (1987).
M.V. Jaric, Introduction to the Mathematics of Quasicrystals, Academic Press, Inc., San Diego (1989).
J. Kari, A small aperiodic set of Wang tiles, Discrete Mathematics, to appear.
D. E. Knuth, The Art of Computer Programming, Vol.1, p.384, Addison-Wesley, Reading, MA (1968).
R. M. Robinson, Undecidability and Nonperiodicity for Tilings of the Plane. Inventiones Mathematicae 12, 177–209 (1971).
R. M. Robinson, Undecidable tiling problems in the hyperbolic plane, Inventiones Mathematicae 44, 259–264 (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Culik, K., Kari, J. (1997). On aperiodic sets of Wang tiles. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052084
Download citation
DOI: https://doi.org/10.1007/BFb0052084
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63746-2
Online ISBN: 978-3-540-69640-7
eBook Packages: Springer Book Archive