![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Cassaigne J.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.218, Iss.1, 1999-04, pp. : 3-12
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)
Language complexity of rotations and Sturmian sequences
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Some properties of the factors of Sturmian sequences
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On a combinatorial property of Sturmian words
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Chuan W.-F.
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :