Abstract
Dube proved some undecidability on self-affine fractals. In this paper, we obtain the decidability for self-similar fractal of Dube’s type. In fact, we prove that the following problems are decidable to test if the Hausdorff dimension of a given Dube’s self-similar set is equal to its similarity dimension, and to test if a given Dube’s self-similar set satisfies the strong separation condition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Dube, S.: Undecidable problems in fractal geometry. Complex Systems 7(6), 423–444 (1993)
Dube, S.: Fractal geometry, Turing machines and divide-and-conquer recurrences. RAIRO Inform. Théor. Appl. 28(3-4), 405–423 (1994)
Falconer, K.J.: Fractal geometry. Mathematical foundations and applications. John Wiley & Sons, Chichester (1990)
Sipser, M.: Introduction to the theory of computation. Course Technology (2005)
Wen, Z.Y.: Mathematical foundations of fractal geometry. Shanghai Scientific and Technological Education Publishing House (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Q., Xi, L. (2011). Decidability on Dube’s Self-similar Fractals. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23887-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-23887-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23886-4
Online ISBN: 978-3-642-23887-1
eBook Packages: Computer ScienceComputer Science (R0)