A test-set for k-power-free binary morphisms

E-ISSN： 1290-385x|35|5|437-452

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.35, Iss.5, 2010-03, pp. : 437-452

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

Reduction in non-(k + 1)-power-free morphisms

By Wlazinski Francis

RAIRO - Theoretical Informatics and Applications, Vol. 50, Iss. 1, 2016-06 ,pp. : 3-20

Edp Sciences

Access to resources Recommend Favorite

On Critical exponents in fixed points of k-uniform binary morphisms

By Krieger Dalia

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 1, 2007-12 ,pp. : 41-68

Edp Sciences

Access to resources Recommend Favorite

Unambiguous erasing morphisms in free monoids

By Schneider Johannes C.

RAIRO - Theoretical Informatics and Applications, Vol. 44, Iss. 2, 2010-05 ,pp. : 193-208

Edp Sciences

Access to resources Recommend Favorite

Morphisms preserving the set of words coding three interval exchange∗∗∗

By Hejda Tomáš

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. : 107-122

Edp Sciences

Access to resources Recommend Favorite

A uniform cube-free morphism is k-power-free for all integers k ≥ 4

RAIRO - Theoretical Informatics and Applications, Vol. 51, Iss. 4, 2018-03 ,pp. : 205-216

Edp Sciences

Access to resources Recommend Favorite