@article {IOPORT.01521895,
    author       = {Mouchard, L.},
    title        = {Normal forms of quasiperiodic strings.},
    year         = {2000},
    journal      = {Theoretical Computer Science},
    volume       = {249},
    number       = {2},
    issn         = {0304-3975},
    pages        = {313-324},
    publisher    = {Elsevier Science Publishers, Amsterdam},
    doi          = {10.1016/S0304-3975(00)00065-7},
    abstract     = {Summary: Here we consider the problem of computing normal forms of quasiperiodic strings. A string $x$ is quasiperiodic if it can be constructed by concatenation and superpositions of one of its proper factor (cover). The notion of quasiperiodicity is a generalization of periodicity in the sense that superpositions as well as concatenations are allowed to define it. It is shown here that given a quasiperiodic string $x,$ there exists a unique factorization of $x$ into roots of its shortest cover and how we can efficiently build such a factorization in linear time. These forms can be used, for example, to test whether or not a string $v$ covers $x^{k}$ for some integer $k,$ where $v$ covers $x$.},
    identifier   = {01521895},
}