Author:
Badkobeh Golnaz,Crochemore Maxime,Rao Michaël
Subject
Computer Science Applications,General Mathematics,Software
Reference14 articles.
1. Badkobeh G., Fewest repetitions vs maximal-exponent powers in infinite binary words.Theoret. Comput. Sci.412(2011) 6625–6633.
2. G. Badkobeh and M. Crochemore, Finite-repetition threshold for infinite ternary words. InWORDS(2011) 37–43.
3. Badkobeh G. and Crochemore M., Fewest repetitions in infinite binary words.RAIRO: ITA46(2012) 17–31.
4. Currie J.D. and Rampersad N., A proof of Dejean’s conjecture.Math. Comput.80(2011) 1063–1070.
5. Dejean F., Sur un théorème de Thue.J. Combin. Theory, Ser. A13(1972) 90–99.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献