A combinatorial problem on Trapezoidal words
- 28 February 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 273 (1-2), 11-33
- https://doi.org/10.1016/s0304-3975(00)00431-x
Abstract
No abstract availableKeywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
- Consiglio Nazionale delle Ricerche
This publication has 5 references indexed in Scilit:
- On the combinatorics of finite wordsTheoretical Computer Science, 1999
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- Sturmian words, Lyndon words and treesTheoretical Computer Science, 1997
- Sur les facteurs des suites de sturmTheoretical Computer Science, 1990
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965