![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Aberkane A.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.307, Iss.1, 2003-09, pp. : 31-46
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)
The P(n)/n-function for bi-infinite words
By Heinis A.
Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Arithmetical complexity of symmetric D0L words
By Frid A.E.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
SOME PROPERTIES OF THE 3 n 1 FUNCTION
Cybernetics and Systems, Vol. 27, Iss. 5, 1996-10 ,pp. :