About Cube-Free Morphisms

Extended Abstract
  • Gwénaël Richomme
  • Francis Wlazinski
Conference paper

DOI: 10.1007/3-540-46541-3_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Richomme G., Wlazinski F. (2000) About Cube-Free Morphisms. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

We address the characterization of finite test-sets for cubefreeness of morphisms between free monoids, that is, the finite sets T such that a morphism f is cube-free if and only if f(T) is cube-free. We first prove that such a finite test-set does not exist for morphisms defined on an alphabet containing at least three letters. Then we prove that for binary morphisms, a set T of cube-free words is a test-set if and only if it contains twelve particular factors. Consequently, a morphism f on {a; b} is cube-free if and only if f(aabbababbabbaabaababaabb) is cube-free (length 24 is optimal). Another consequence is an unpublished result of Leconte: A binary morphism is cube-free if and only if the images of all cube-free words of length 7 are cube-free.

We also prove that, given an alphabet A containing at least two letters, the monoid of cube-free endomorphisms on A is not finitely generated.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Gwénaël Richomme
    • 1
  • Francis Wlazinski
    • 1
  1. 1.LaRIAUniversité de Picardie Jules VerneAmiensFrance

Personalised recommendations