Show simple item record

dc.contributor.authorCurrie, James D.
dc.contributor.authorSaari, Kalle
dc.date.accessioned2018-03-01T20:23:49Z
dc.date.available2018-03-01T20:23:49Z
dc.date.issued2009
dc.identifier.citationCurrie, James D., and Kalle Saari. "Least Periods of Factors of Infinite Words." RAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications 43(1) (2009): 165-178. DOI: 10.1051/ita:2008006.en_US
dc.identifier.issn0988-3754
dc.identifier.urihttp://hdl.handle.net/10680/1372
dc.description.abstractWe show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci word is the set of Fibonacci numbers. As a byproduct of our results, we give several new proofs and tightenings of well-known properties of Sturmian words.en_US
dc.description.sponsorshipWork of the first author supported by a Discovery Grant from NSERC. Work of the second author supported by the Finnish Academy under grant 8206039.en_US
dc.description.urihttps://www.rairo-ita.org/articles/ita/abs/2009/01/ita08003/ita08003.html
dc.language.isoenen_US
dc.publisherEDP Sciencesen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectPeriodicityen_US
dc.subjectFibonacci worden_US
dc.subjectThue-Morse worden_US
dc.subjectSturmian worden_US
dc.titleLeast Periods of Factors of Infinite Wordsen_US
dc.typeArticleen_US
dc.identifier.doi10.1051/ita:2008006


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record