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 algorith...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
University of North Texas
1998
|
| Subjects: | |
| Online Access: | https://digital.library.unt.edu/ark:/67531/metadc278440/ |