On the number of factors of Sturmian words
Theoretical Computer Science
Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
On the combinatorics of finite words
Theoretical Computer Science
Periodic-like words, periodicity, and boxes
Acta Informatica
A combinatorial problem on Trapezoidal words
Theoretical Computer Science
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
European Journal of Combinatorics
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Central sturmian words: recent developments
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A characterization of bispecial sturmian words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
Hi-index | 5.23 |
Trapezoidal words are words having at most n+1 distinct factors of length n for every n=0. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated prefix is a palindrome. We also define a new class of words, semicentral words, and show that they are characterized by the property that they can be written as uxyu, for a central word u and two different letters x,y. Finally, we investigate the prefixes of the Fibonacci word with respect to the property of being open or closed trapezoidal words, and show that the sequence of open and closed prefixes of the Fibonacci word follows the Fibonacci sequence.