Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-09T16:19:39.645Z Has data issue: false hasContentIssue false

On a paper by Castelli, Mignosi, Restivo

Published online by Cambridge University Press:  15 April 2002

Jacques Justin*
Affiliation:
LIAFA, Université Paris VII, Case 7014, 2 place Jussieu, 75251 Paris Cedex 05, France; ([email protected]) Mailing address: 19 rue de Bagneux, 92330 Sceaux, France
Get access

Abstract

Fine and Wilf's theorem has recently been extended to words having threeperiods. Following the method of the authors we extend it to anarbitrary number of periods and deduce from that a characterization ofgeneralized Arnoux-Rauzy sequences or episturmian infinite words.

Type
Research Article
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arnoux, P. and Rauzy, G., Représentation géométrique de suites de complexité 2n+1. Bull. Soc. Math. France 119 (1991) 199-215. CrossRef
Castelli, M.G., Mignosi, F. and Restivo, A., Fine and Wilf's theorem for three periods and a generalization of Sturmian words. Theoret. Comput. Sci. 218 (1999) 83-94. CrossRef
de Luca, A., Sturmian words, structure, combinatorics and their arithmetics. Theoret. Comput. Sci. 183 (1997) 45-82. CrossRef
X. Droubay, J. Justin and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. (to appear).
Fine, N.J. and Wilf, H.S., Uniqueness Theorem for Periodic Functions. Proc. Am. Math. Soc. 16 (1965) 109-114. CrossRef
J. Justin and G. Pirillo, Episturmian words and episturmian morphisms. Preprint.
M. Lothaire, Combinatorics on Words. Addison-Wesley, Reading, MA (1983).