首页 | 本学科首页   官方微博 | 高级检索  
     


On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Authors:Roman Kolpakov  Michaël Rao
Affiliation:
  • a Moscow State University, Leninskie Gory, 119992 Moscow, Russia
  • b LaBRI, Université Bordeaux 1, 351 cours de la libération, 33405 Talence, France
  • Abstract:We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for 5≤k≤10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0.005. As a consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for 5≤k≤10.
    Keywords:Combinatorics on words  Repetitions  Growth rates
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号