Author： Seebold P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.195, Iss.1, 1998-03, pp. : 91-109
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
By de Luca A.
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :
Access to resources
Recommend
Formal Aspects of Computing, Vol. 13, Iss. 3-5, 2002-07 ,pp. :
Episturmian words and episturmian morphisms
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :
On the complexity of specification morphisms
By Cicerone S. Parisi-Presicce F.
Theoretical Computer Science, Vol. 189, Iss. 1, 1997-12 ,pp. :
Conjugacy and episturmian morphisms
By Richomme G.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :