Words whose complexity satisfies limp(n)n=1

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.

Previous Menu Next

Abstract

Related content

The P(n)/n-function for bi-infinite words

By Heinis A.  

Theoretical Computer Science, Vol. 273, Iss. 1, 2002-02 ,pp. : 35-46

Elsevier

Access to resources Recommend Favorite

The Khalimsky topologies are precisely those simply connected topologies on Z n whose connected sets include all 2n-connected sets but no (3 n -1)-disconnected sets

By Kong T.Y.  

Theoretical Computer Science, Vol. 305, Iss. 1, 2003-08 ,pp. : 221-235

Elsevier

Access to resources Recommend Favorite

On the computational complexity of infinite words

By Duris P.   Manuch J.  

Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. : 141-151

Elsevier

Access to resources Recommend Favorite

Arithmetical complexity of symmetric D0L words

By Frid A.E.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 535-542

Elsevier

Access to resources Recommend Favorite

SOME PROPERTIES OF THE 3 n 1 FUNCTION

By Banerji Ranan B.  

Cybernetics and Systems, Vol. 27, Iss. 5, 1996-10 ,pp. : 473-486

Taylor & Francis Ltd

Access to resources Recommend Favorite