On Abelian Squares and Substitutions
暂无分享，去创建一个
We study substitutions preserving Abelian square-free words and the more general notion of substitutions with bounded Abelian squares. In particular, we prove the existence of algorithms deciding whether a substitution mapping each letter into a set of commutatively equivalent words belongs to one of these classes.
[1] P. Erdos. Some unsolved problems. , 1957 .
[2] Veikko Keränen,et al. Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.
[3] Arturo Carpi,et al. On Abelian Power-Free Morphisms , 1993, Int. J. Algebra Comput..
[4] F. Michel Dekking,et al. Strongly Non-Repetitive Sequences and Progression-Free Sets , 1979, J. Comb. Theory, Ser. A.
[5] Arturo Carpi,et al. On the Number of Abelian Square-free Words on Four Letters , 1998, Discret. Appl. Math..