Avoiding square-free words on free groups
暂无分享,去创建一个
Tero Harju | Pascal Ochem | Golnaz Badkobeh | Matthieu Rosenfeld | T. Harju | Golnaz Badkobeh | M. Rosenfeld | P. Ochem
[1] Maxime Crochemore,et al. Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..
[2] Alfred J. van der Poorten,et al. Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..
[3] Pascal Ochem,et al. A generator of morphisms for infinite words , 2006, RAIRO Theor. Informatics Appl..
[4] J. Allouche. Algebraic Combinatorics on Words , 2005 .
[5] K. A. Baker,et al. Growth Problems for Avoidable Words , 1989, Theor. Comput. Sci..
[6] Tero Harju,et al. Combinatorics on Words , 2004 .
[7] F. Blanchet-Sadri,et al. ABELIAN COMPLEXITY OF FIXED POINT OF MORPHISM , 2014 .
[8] Matthieu Rosenfeld,et al. Avoiding squares over words with lists of size three amongst four symbols , 2021, Math. Comput..
[9] Roman Kolpakov,et al. On the number of repetition-free words , 2007 .
[10] James D. Currie,et al. Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1 , 2014, Integers.
[11] James D. Currie. Finite Test Sets for Morphisms That Are Squarefree on Some of Thue's Squarefree Ternary Words , 2019, J. Integer Seq..
[12] Richard A. Dean. A Sequence Without Repeats on x, x -1 , y, y -1 , 1965 .
[13] Arseny M. Shur. Two-Sided Bounds for the Growth Rates of Power-Free Languages , 2009, Developments in Language Theory.