Author:
Blanchet-Sadri F.,Mercaş Robert,Scott Geoffrey
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Partial words and a theorem of Fine and Wilf;Berstel;Theoret. Comput. Sci.,1999
2. Avoidable patterns in strings of symbols;Bean;Pacific J. Math.,1979
3. Algorithmic Combinatorics on Partial Words;Blanchet-Sadri,2007
4. On Dejean’s conjecture over larger alphabets;Carpi;Theoret. Comput. Sci.,2007
5. Sur un théorème de Thue;Dejean;J. Combin. Theory Ser. A,1972
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Clusters of Repetition Roots: Single Chains;SOFSEM 2021: Theory and Practice of Computer Science;2021
2. Square-Free Partial Words with Many Wildcards;International Journal of Foundations of Computer Science;2018-08
3. On the aperiodic avoidability of binary patterns with variables and reversals;Theoretical Computer Science;2017-06
4. Ternary Square-Free Partial Words with Many Wildcards;Developments in Language Theory;2016
5. How to play Thue games;Theoretical Computer Science;2015-05