Author： Berstel J. de Luca A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.178, Iss.1, 1997-05, pp. : 171-203
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Lyndon words and singular factors of sturmian words
By Melancon G.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Access to resources
Recommend
Lyndon words, permutations and trees
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :
Sturmian words and words with a critical exponent
By Vandeth D.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
On a combinatorial property of Sturmian words
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
By Chuan W.-F.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :