Author:
Badkobeh Golnaz,Crochemore Maxime
Subject
Computer Science Applications,General Mathematics,Software
Reference11 articles.
1. G. Badkobeh and M. Crochemore, An infinite binary word containing only three distinct squares (2010) Submitted.
2. Currie J.D. and Rampersad N., A proof of Dejean’s conjecture.Math. Comput.80(2011) 1063–1070.
3. Dejean F., Sur un théorème de Thue.J. Comb. Theory, Ser. A13(1972) 90–99.
4. A.S. Fraenkel and J. Simpson, How many squares must a binary sequence contain?Electr. J. Comb.2(1995).
5. Harju T. and Nowotka D., Binary words with few squares.Bulletin of the EATCS89(2006) 164–166.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献