Abstract
In this paper we present a construction of Kari-Culik aperiodic tile set, the smallest known until now. Our construction is self-contained and organized to allow reasoning on properties of the resulting sets of tilings. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Durand, B., Gamard, G., & Grandjean, A. (2014). Aperiodic tilings and entropy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8633 LNCS, pp. 166–177). Springer Verlag. https://doi.org/10.1007/978-3-319-09698-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
