![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: V'yugin V.V.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.207, Iss.2, 1998-11, pp. : 363-382
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Complexity for finite factors of infinite sequences
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Marrero-Ponce Yovani Castillo-Garit Juan
Journal of Computer-Aided Molecular Design, Vol. 19, Iss. 6, 2005-06 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Finite acceptance of infinite words
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Finite and infinite pseudorandom binary words
By Mauduit C.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :