Author： Karhumaki J. Manuch J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.273, Iss.1, 2002-02, pp. : 81-97
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
Generalized factorizations of words and their algorithmic properties
By Karhumaki J. Plandowski W. Rytter W.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Access to resources
Recommend
A defect theorem for bi-infinite words
By Karhumaki J. Manuch J. Plandowski W.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Hajos factorizations and completion of codes
By Nguyen H.L.
Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. :