Tilings and patterns
On the number of factors of Sturmian words
Theoretical Computer Science
A characterization of substitutive sequences using return words
Discrete Mathematics
Complexity for finite factors of infinite sequences
Theoretical Computer Science
Sturmian words and words with a critical exponent
Theoretical Computer Science
Fractional powers in Sturmian words
Theoretical Computer Science
A chararcterization of sturmian words by return words
European Journal of Combinatorics
The index of Sturmian sequences
European Journal of Combinatorics
On the Index of Sturmian Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
European Journal of Combinatorics
| Hi-index | 0.00 |
The paper is concerned with hierarchical stuctures in subshifis over a finite alphabet. In particular, we present a hierarchy-based approach to Sturmian systems. This approach is then used to characterize the linearly repetitive Sturmian systems (among the Sturmian systems) by uniform positivity of certain weights. More generally, we discuss various bounds on weights and their relationship.Finally, we combine hierarchies and bounds on a weights to study a thermodynamic formalism for lattice gas models associated to arbitrary linearly repetitive subshifts.