Sturmian words: Structure, combinatorics, and their arithmetics

Theoretical Computer Science

Volumn 183, Issue 1, 1997, Pages 45-82

  De Luca, Aldo ^a,b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

Author keywords

Palindromes; Standard words; Sturmian words

Indexed keywords

COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

FAREY CORRESPONDENCE; PALINDROMES; STURMIAN WORDS;

FORMAL LANGUAGES;

EID: 0031210138     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00310-6     Document Type: Article

References (18)

1. J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985.
2. J. Berstel, P. Séébold, A remark on Morphic Sturmian words, R.A.I.R.O., I.T. 28 (1994) 255-263.
3. T.C. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull. 36 (1993) 15-21.
4. E.B. Christoffel, Observatio Arithmetica, Ann. Mat. Pura Appl. 6 (1875) 145-152.
5. A. de Luca, A combinatorial property of the Fibonacci word, Inform. Process. Lett. 12 (1981) 193-195.
6. A. de Luca, Sturmian words: new combinatorial results, in: J. Almeida, G.M.S. Gomes, P.V. Silva (Eds.), Proc. Conf. on Semigroups Automata and Languages, Porto, 1994, World Scientific, Singapore, 1996, pp. 67-83.
7. A. de Luca, F. Mignosi, On some Combinatorial properties of Sturmian words, Theoret. Comput. Sci. 136 (1994) 361-385.
8. S. Dulucq, D. Gouyou-Beauchamps, Sur les facteurs des suites de Sturm, Theoret. Comput. Sci. 71 (1990) 381-400.
9. N.J. Fine, H.S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109-114.
10. G.A. Hedlund, M. Morse, Sturmian sequences, Amer. J. Math. 61 (1940) 605-620.
11. M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, MA, 1983.
12. F. Mignosi, Infinite words with linear subword complexity, Theoret. Comput. Sci. 65 (1989) 221-242.
13. F. Mignosi, On the number of factors of Sturmian words, Theoret. Comput. Sci. 82 (1991) 71-84.
14. A. Pedersen, Solution of Problem E 3156, Amer. Math. Monthly 95 (1988) 954-955.
15. G.N. Raney, On continued fractions and finite automata, Math. Ann. 206 (1973) 265-283.
16. G. Rauzy, Mots infinis en arithmétique, in: M. Nivat, D. Perrin (Eds.), Automata on Infinite Words, Lectures Notes in Computer Science, vol. 192, Springer, Berlin, 1984, pp. 165-171.
17. R.M. Robinson, Problem E3156, Amer. Math. Monthly 93 (1986) 482.
18. B.A. Venkov, Elementary Number Theory, Wolters-Noordhoff, Pays-Bas, 1970.