Undecidable Properties of Self-affine Sets and Multi-tape Automata
We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These results are obtained by studying a particular class of self-affine sets associated with multi-tape automata. We first establish the undecidability of some language-theoretical properties of such automata, which then translate into undecidability results about their associated self-affine sets.
Unable to display preview. Download preview PDF.
- 2.Bedford, T.: Crinkly curves, Markov partitions and box dimensions in self-similar sets. Ph.D. thesis, University of Warwick (1984)Google Scholar
- 6.Falconer, K.: Techniques in fractal geometry. John Wiley & Sons Ltd., Chichester (1997)Google Scholar
- 7.Falconer, K.: Fractal geometry, 2nd edn. Mathematical Foundations and Applications. John Wiley & Sons Inc., Hoboken (2003)Google Scholar
- 8.Fraser, J.M.: Dimension theory and fractal constructions based on self-affine carpets. Ph.D. thesis, The University of St Andrews (2013)Google Scholar
- 9.Gabardo, J.P., Yu, X.: Natural tiling, lattice tiling and Lebesgue measure of integral self-affine tiles. J. London Math. Soc. (2) 74(1), 184–204 (2006)Google Scholar
- 15.Wang, Y.: Self-affine tiles. In: Advances in Wavelets (Hong Kong, 1997), pp. 261–282. Springer, Singapore (1999)Google Scholar