Author:
Ochem Pascal,Rao Michaël,Rosenfeld Matthieu
Publisher
Springer International Publishing
Reference67 articles.
1. Aistleitner, C., Becher, V., Scheerer, A.M., Slaman, T.: On the construction of absolutely normal numbers. Acta Arith. (to appear), arXiv:1702.04072
2. Badkobeh, G., Crochemore, M.: Finite-repetition threshold for infinite ternary words. In: WORDS. EPTCS, vol. 63, pp. 37–43 (2011)
3. Badkobeh, G., Crochemore, M.: Fewest repetitions in infinite binary words. RAIRO Theor. Inform. Appl. 46(1), 17–31 (2012)
4. Badkobeh, G., Crochemore, M., Rao, M.: Finite repetition threshold for large alphabets. RAIRO Theor. Inform. Appl. 48(4), 419–430 (2014)
5. Baker, K.A., McNulty, G.F., Taylor, W.: Growth problems for avoidable words. Theor. Comput. Sci. 69(3), 319–345 (1989)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On ternary Dejean words avoiding 010;Notes on Number Theory and Discrete Mathematics;2023-07-27
2. Abelian combinatorics on words: A survey;Computer Science Review;2023-02
3. Fractional meanings of nonrepetitiveness;Journal of Combinatorial Theory, Series A;2022-07