Semigroups and Combinatorial Applications
Semigroups and Combinatorial Applications
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Binary patterns in infinite binary words
Formal and natural computing
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Sequences of linear arithmetical complexity
Theoretical Computer Science - Combinatorics on words
On the arithmetical complexity of Sturmian words
Theoretical Computer Science
Asymptotic subword complexity of fixed points of group substitutions
Theoretical Computer Science
Constructing Infinite Words of Intermediate Arithmetical Complexity
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Subword complexity of uniform D0L words over finite groups
Theoretical Computer Science
| Hi-index | 5.23 |
We characterize and count words which occur in arithmetical subsequences of fixed points of symmetric morphisms.