Logic and Theory of Algorithms
DOI: 10.1007/978-3-540-69407-6_27
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet Σ that satisfy some given condition P on the asymptotic frequencies with which various symbols from Σ appear in S. Solutions to this problem are known in cases where (i) the fractal dimension is classical (Hausdorff or packing dimension), or (ii) the fractal dimension is effective (even finite-state) and the condition P completely specifies an empirical distribution π ove… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 35 publications
(40 reference statements)
0
0
0
Order By: Relevance