暂无分享,去创建一个
[1] James D. Currie,et al. A proof of Dejean's conjecture , 2009, Math. Comput..
[2] James D. Currie,et al. Dejean's conjecture holds for $\sf {N\ge 27}$ , 2009, RAIRO Theor. Informatics Appl..
[3] Arseny M. Shur,et al. On the existence of Minimal β-powers , 2011, Int. J. Found. Comput. Sci..
[4] I Tomohiro,et al. Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes , 2019, Theor. Comput. Sci..
[5] Anna E. Frid. Overlap-free symmetric D0L words , 2001, Discret. Math. Theor. Comput. Sci..
[6] Jean-Jacques Pansiot. A propos d'une conjecture de F. Dejean sur les répétitions dans les mots , 1984, Discret. Appl. Math..
[7] Arnaud Lefebvre,et al. Abelian Powers and Repetitions in Sturmian Words , 2015, Theor. Comput. Sci..
[8] James D. Currie,et al. A family of formulas with reversal of high avoidability index , 2016, Int. J. Algebra Comput..
[9] Arseny M. Shur,et al. On the Existence of Minimal beta-Powers , 2010, Developments in Language Theory.
[10] James D. Currie,et al. Avoidability Index for Binary Patterns with Reversal , 2016, Electron. J. Comb..
[11] James D. Currie,et al. Avoidance bases for formulas with reversal , 2018, Theor. Comput. Sci..
[12] James D. Currie,et al. Avoiding Patterns in the Abelian Sense , 2001, Canadian Journal of Mathematics.
[13] F. Michel Dekking,et al. Strongly Non-Repetitive Sequences and Progression-Free Sets , 1979, J. Comb. Theory, Ser. A.
[14] Michaël Rao,et al. Last cases of Dejean's conjecture , 2011, Theor. Comput. Sci..
[15] Matthieu Rosenfeld,et al. Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable , 2016, MFCS.
[16] James D. Currie,et al. Words Strongly Avoiding Fractional Powers , 1999, Eur. J. Comb..
[17] Arturo Carpi,et al. On Dejean's conjecture over large alphabets , 2007, Theor. Comput. Sci..
[18] James D. Currie,et al. Dejean's conjecture and Sturmian words , 2007, Eur. J. Comb..
[19] James D. Currie,et al. Long binary patterns are Abelian 2-avoidable , 2008, Theor. Comput. Sci..
[20] Benny Sudakov,et al. Unavoidable patterns , 2008, J. Comb. Theory, Ser. A.
[21] Franz-Josef Brandenburg,et al. Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..
[22] Florin Manea,et al. Longest α-Gapped Repeat and Palindrome , 2015, FCT.
[23] Françoise Dejean,et al. Sur un Théorème de Thue , 1972, J. Comb. Theory A.
[24] Hamoon Mousavi,et al. Automatic Theorem Proving in Walnut , 2016, ArXiv.
[25] Veikko Keränen,et al. Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.
[26] Arseny M. Shur,et al. On Abelian repetition threshold , 2012, RAIRO Theor. Informatics Appl..
[27] Arseny M. Shur. Growth of Power-Free Languages over Large Alphabets , 2013, Theory of Computing Systems.
[28] Maxime Crochemore,et al. Optimal bounds for computing α-gapped repeats , 2019, Inf. Comput..
[29] J. Berstel. Axel Thue''s papers on repetitions in words: a translation. In: Publications du LaCIM, vol. 20. U , 1992 .
[30] Jean Moulin Ollagnier,et al. Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters , 1992, Theor. Comput. Sci..
[31] Philippe Duchon,et al. Gapped Pattern Statistics , 2017, CPM.