Theoretical Computer Science
Hierarchical structures in Sturmian dynamical systems
Theoretical Computer Science - Special issue: Tilings of the plane
On the subword complexity of Thue–Morse polynomial extractions
Theoretical Computer Science
Algorithms for subsequence combinatorics
Theoretical Computer Science
Asymptotic subword complexity of fixed points of group substitutions
Theoretical Computer Science
Subword complexity of uniform D0L words over finite groups
Theoretical Computer Science
Hi-index | 5.23 |