On the factors of the Sturmian sequences
Theoretical Computer Science
Sturmian words, Lyndon words and trees
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
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Enumeration and structure of trapezoidal words
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper, we investigate some combinatorial properties concerning the family of the so-called Trapezoidal words. Trapezoidal words, considered in de Luca (Theoret. Comput. Sci. 218 (1999) 13-39 are finite words over the two-letter alphabet A={a,b} whose subword complexity has the same behaviour as that of finite Sturmian words. In de Luca (Theoret. Comput. Sci. 218 (1999) 13-39 it has been proved that the family of Finite Sturmian words is properly contained in that one of Trapezoidal words. We carry on with the studying of the family of Trapezoidal words and, in particular, of its relation with that one of finite Sturmian words.