Part of the Lecture Notes in Computer Science book series (LNCS, volume 1337)
On aperiodic sets of Wang tiles
KeywordsFinite Automaton Sequential Machine Balance Representation Deterministic Finite Automaton Output Alphabet
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.
- 2.R. Berger, The Undecidability of the Domino Problem, Mem. Amer. Math. Soc. 66 (1966).Google Scholar
- 3.K. Culik II, An aperiodic set of 13 Wang tiles, Discrete Mathematics, to appear.Google Scholar
- 6.J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).Google Scholar
- 8.B. Grünbaum and G.C. Shephard, Tilings and Patterns, W.H.Freeman and Company, New York (1987).Google Scholar
- 9.M.V. Jaric, Introduction to the Mathematics of Quasicrystals, Academic Press, Inc., San Diego (1989).Google Scholar
- 10.J. Kari, A small aperiodic set of Wang tiles, Discrete Mathematics, to appear.Google Scholar
- 11.D. E. Knuth, The Art of Computer Programming, Vol.1, p.384, Addison-Wesley, Reading, MA (1968).Google Scholar
© Springer-Verlag Berlin Heidelberg 1997