Research in the theory of &ohgr;-languages
Journal of Information Processing and Cybernetics
A theorem on the entropy of submonoids (Note)
Theoretical Computer Science
Fractals everywhere
The algorithmic beauty of plants
The algorithmic beauty of plants
Fractals for the classroom. Part 1.: Introduction to fractals and chaos
Fractals for the classroom. Part 1.: Introduction to fractals and chaos
Self-similarity of linear cellular automata
Journal of Computer and System Sciences
Affine automata and related techniques for generation of complex images
Theoretical Computer Science
Collages and patterns generated by hyperedge replacement
Languages of Design
Kolmogorov complexity and Hausdorff dimension
Information and Computation
Valuations of languages, with applications to fractal geometry
Theoretical Computer Science
Codes, simplifying words, and open set condition
Information Processing Letters
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
Visual models of plant development
Handbook of formal languages, vol. 3
Digital images and formal languages
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
Handbook of Formal Languages
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Methods for Generating Deterministic Fractals and Image Compression
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Rich omega-Words and Monadic Second-Order Arithmetic
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Architectural bias in recurrent neural networks: fractal analysis
Neural Computation
Weighted finite automata and metrics in cantor space
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Blind Counter Automata on ω-Words
Fundamenta Informaticae
Dimensions of Points in Self-similar Fractals
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the Hausdorff measure of ω-power languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Blind Counter Automata on ω-Words
Fundamenta Informaticae
| Hi-index | 0.00 |
Valuations---morphisms from (∑*, ·, e) to ((0,∞ ), ·, 1)---are a generalization of Bernoulli morphisms introduced by Eilenberg ["Automata, languages, and machines," Academic Press, New York, 1974]. Here, we show how to generalize the notion of entropy (of a language) in order to obtain new formulas to determine the Hausdorff dimension of fractal sets (also in Euclidean spaces), especially defined via regular (ω-) languages. By doing this, we can sharpen and generalize earlier results in two ways: first, we treat the case where the underlying basic iterated function system contains noncontractive mappings and, second, we obtain results valid for nonregular languages as well. Copyright 2001 Academic Press.