Advertisement

On strongly cube-free ω-words generated by binary morphisms

  • Juhani Karhumäki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Abstract

An ω-word is called strongly cube-free if it does not contain a subword of the form vvfirst(v), with v ≠ λ. We show that it is decidable whether a given morphism over a binary alphabet defines, when applied iteratively, a strongly cube-free ω-word. Moreover, an explicit and reasonably small upper bound for the number of iterations needed to be checked is given.

Keywords

Decision Problem Basic Notion Symbolic Dynamic Springer Lecture Note Free Monoid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [B]
    J. Berstel, Sur les mots sans carré définis par un morphisme. Springer Lecture Notes in Computer Science v. 71, 1979, 16–25.Google Scholar
  2. [H]
    M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978.Google Scholar
  3. [K]
    J. Karhumäki, On cube-free ω-words generated by morphisms, manuscript.Google Scholar
  4. [MH]
    M. Morse and G.A. Hedlund, Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J. 11, 1944, 1–7.Google Scholar
  5. [T1]
    A. Thue, Über unendliche Zeichenreihen,Norsk. Vid. Selsk. Skr. I, Mat. — Nat. Kl. Nr. 7, 1906, 1–22.Google Scholar
  6. [T2]
    A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norsk. Vid. Selsk. Skr. I, Mat.-Nat. Kl. Nr. 1 (1912), 1–67.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Juhani Karhumäki
    • 1
  1. 1.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations