Smooth words on 2-letter alphabets having same parity

@article{Brlek2008SmoothWO,
  title={Smooth words on 2-letter alphabets having same parity},
  author={Srecko Brlek and Damien Jamet and Genevi{\`e}ve Paquin},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={393},
  pages={166-181}
}
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that the closure of the set of factors under reversal holds for odd alphabets only. We provide a linear time algorithm computing the extremal words, w.r.t. lexicographic order. The minimal word is an infinite Lyndon word if and only if either a = 1 and b odd, or a, b are even. A connection is established between generalized… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

On the structure of self generating sequences

  • F. M. Dekking
  • Séminaire de théorie des nombres de Bordeaux…
  • 1981
Highly Influential
5 Excerpts

Combinatorial properties of smooth infinite words , Theoret

  • S. Dulucq S. Brlek, A. Ladouceur, L. Vuillon
  • Comput . Sci .
  • 2006

Discrete surfaces and infinite smooth words

  • D. Jamet, G. Paquin
  • FPSAC’05 - 17th annual International conference…
  • 2005
2 Excerpts

Substitutions in Dynamics

  • N. Pytheas-Fogg
  • Arithmetics and Combinatorics, LNM 1794, Springer…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…