A combinatorial problem on Trapezoidal words
暂无分享，去创建一个
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.
[1] H. Wilf,et al. Uniqueness theorems for periodic functions , 1965 .
[2] Aldo de Luca,et al. On the Combinatorics of Finite Words , 1999, Theor. Comput. Sci..
[3] S. Dulucq,et al. On the factors of the Sturmian sequences , 1990 .
[4] Aldo de Luca,et al. Sturmian Words, Lyndon Words and Trees , 1997, Theor. Comput. Sci..
[5] Aldo de Luca,et al. Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..