Author： Duval J.-P. Mignosi F. Restivo A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 269-284
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
Periods in Extensions of Words
Acta Informatica, Vol. 43, Iss. 3, 2006-10 ,pp. :
Access to resources
Recommend
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
Finite acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
A periodicity result of partial words with one hole
Computers and Mathematics with Applications, Vol. 46, Iss. 5, 2003-09 ,pp. :
A defect theorem for bi-infinite words
By Karhumaki J. Manuch J. Plandowski W.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :