Arrow Research search
Back to MFCS

MFCS 1998

IFS and Control Languages

Conference Paper Picture Languages - Function Systems/Complexity Algorithms and Complexity · Theoretical Computer Science

Abstract

Abstract Valuations — morphisms from (σ *, ·, e ) to ((0, ∞), ·, 1) —are a generalization of Bernoulli morphisms introduced in [7]. Here, we show how to generalize the notion of entropy (of a language) in order to obtain new formulae to determine the Hausdorff dimension of fractal sets (also in Euclidean spaces) especially defined via regular Ω-languages. In this way, we can sharpen and generalize earlier results [1, 10, 11, 20, 29].

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
302808762551240994
v2026.09.13