Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Berstel, J.: Growth of repetition-free words—a review. Theor. Comput. Sci. 340, 280–290 (2005)
2. Berstel, J., Karhumäki, J.: Combinatorics on words: a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. 79, 178–228 (2003)
3. Brandenburg, F.-J.: Uniformly growing k-th power free homomorphisms. Theor. Comput. Sci. 23, 69–82 (1983)
4. Carpi, A.: On Dejean’s conjecture over large alphabets. Theor. Comput. Sci. 385, 137–151 (2007)
5. Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67(3), 111–117 (1998)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献