A generalization of Sturmian sequences: Combinatorial structure and transcendence
A generalization of Sturmian sequences: Combinatorial structure and transcendence
We investigate a class of minimal sequences on a finite alphabet Ak = {1,2,...,k} having (k - 1)n + 1 distinct subwords of length n. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of binary Sturmian sequences. We describe two simple combinatorial algorithms for …