Journal article
Powers in a class of A-strict standard episturmian words
Theoretical Computer Science, Vol.380(3), pp.330-354
2007
Abstract
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz [D. Damanik, D. Lenz, Powers in Sturmian sequences, European J. Combin. 24 (2003) 377-390, doi:10.1016/S0195-6698(03)00026-X], who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the k-bonacci word, a generalization of the Fibonacci word to a k-letter alphabet (k ≥ 2).
Details
- Title
- Powers in a class of A-strict standard episturmian words
- Authors/Creators
- A. Glen (Author/Creator) - Université du Québec à Montréal
- Publication Details
- Theoretical Computer Science, Vol.380(3), pp.330-354
- Publisher
- Elsevier BV
- Identifiers
- 991005540099807891
- Copyright
- © 2007 Elsevier Ltd.
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
125 File views/ downloads
69 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Citation topics
- 9 Mathematics
- 9.28 Pure Maths
- 9.28.534 Dynamical Systems
- Web Of Science research areas
- Computer Science, Theory & Methods
- ESI research areas
- Computer Science