New Lower-bound on the Number of Ternary Square-free Words

@inproceedings{Sun2003NewLO,
  title={New Lower-bound on the Number of Ternary Square-free Words},
  author={Xinyu Sun},
  year={2003}
}
A new lower bound on the number of n-letter ternary square-free words is presented: 110, which improves the previous best result of 65. 

References

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

There are more than 2 n-letter ternary square-free words

  • S. B. Ekhad, D. Zeilberger
  • J. Integer Seq
  • 1998
Highly Influential
5 Excerpts

The entropy of square-free

  • M. Baake, V. Elaser, U. Grimm
  • words, Math. Comput. Modelling
  • 1997
Highly Influential
4 Excerpts

A characterization of powerfree morphisms , Theoret

  • Michel Leconte
  • Comput . Sci .
  • 2001

The entropy of square - free words

  • F.-J. Brandenburg
  • Math . Comput . Modelling
  • 1997

Nonrepetitive sequences on three symbols

  • Crochemore
  • Quart . J . Math . Oxford
  • 1983

Nonrepetitive sequences on three symbols, Quart

  • J. Brinkhuis
  • J. Math. Oxford
  • 1983
3 Excerpts

Similar Papers

Loading similar papers…