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. (C) 2002 Published by Elsevier Science B.V.
A combinatorial problem on Trapezoidal words / D'Alessandro, Flavio. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 273:1-2(2002), pp. 11-33. [10.1016/s0304-3975(00)00431-x]
A combinatorial problem on Trapezoidal words
D'ALESSANDRO, Flavio
2002
Abstract
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. (C) 2002 Published by Elsevier Science B.V.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
