Author： Carpi A. de Luca A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.259, Iss.1, 2001-05, pp. : 145-182
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
By Mignosi F. Restivo A. Sciortino M.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
Access to resources
Recommend
Lyndon words and singular factors of sturmian words
By Melancon G.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Biinfinite words with maximal recurrent unbordered factors
By Costa J.C.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
On the number of occurrences of all short factors in almost all words
By Tomescu I.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
By Novák Vilém
International Journal of General Systems, Vol. 42, Iss. 1, 2013-01 ,pp. :