Fractals, Dimension, and Formal Languages
نویسندگان
چکیده
We consider classes of sets of r-adic expansions of reals speciied by means of the theory of formal languages or automata theory. It is shown how these speciications are used to calculate the Hausdorr dimension and Hausdorr measure of such sets. Since the appearence of Mandelbrot's 11 book \Fractals, Form, Chance and Dimen-sion" Fractal Geometry as a means providing a theory describing many of the seemingly complex patterns in nature and the sciences has become popular not only in the sciences (cf. Peitgen and Saupe 13), but also in computer science. Here Barnsley's 3 "Computa-tional Fractal Geometry" aims at a practical description of fractal patterns by so-called Iterative Function Systems (IFS). Besides IFS several other computational methods for the description (generation) of fractal images involving concepts of Automata or Formal Language Theory have been developed (see e.g. Berstel and Morcrette 4 , Berstel and Nait-Abdallah 5 , Culik and Dube 6; 7 , Prusinkiewicz et al. 14 , or Smith 15). These papers, however, deal mainly with the generation of fractal images by nite computational devices. On the other hand it is known from geometric measure theory (cf. Falconer 8) that the analysis, that is, the estimation of the fractal dimension or measure of even rather simply deenable sets is already a complicated task.
منابع مشابه
Valuations of Languages, with Applications to Fractal Geometry
But even the very hairs of your head are all numbered. Fear not therefore: ye are of more value than many sparrows. shows that valuations are useful not only within the theory of codes, but also when dealing with ambiguity, especially in contextfree grammars, or for deening outer measures on the space of !-words which are of some importance to the theory of fractals. These connections yield new...
متن کاملA Formal Treatment of Deterministic Fractals
We explore in depth the theory behind deterministic fractals by investigat ing transformations on metric spaces and the contraction mapping theorem. In doing so we introduce the notion of the Hausdorff distance metric and its connection to the space of fractals. In order to understand how deterministic fractals are generated, we develop the concept of an iterated function system (IFS) and what...
متن کاملDimensions of fractals related to languages defined by tagged strings in complete genomes
A representation of frequency of strings of length K in complete genomes of many organisms in a square has led to seemingly self-similar patterns when K increases. These patterns are caused by under-represented strings with a certain “tag”-string and they define some fractals in the K → ∞ limit. The Box and Hausdorff dimensions of the limit set are discussed. Although the method proposed by Mau...
متن کاملSelf-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کامل[inria-00510143, v1] Construction of fractals using formal languages and matrices of attractors
LRIFS's (Language-Restricted Iterated Function Systems) generalize the original de nition of IFS's (Iterated Function Systems) by providing tools for restricting the sequences of applicable transformations.In this paper, we study an approach of LRIFS's based on matrices and graph theory. This enables us to generate a matrix which elements are attractors.
متن کامل