On Abelian squares and substitutions

Theoretical Computer Science

Volumn 218, Issue 1, 1999, Pages 61-81

  Carpi, Arturo ^a  

^a CNR   (Italy)

Author keywords

Abelian square; Avoidable regularity; Free monoid

Indexed keywords

EID: 0039789462     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00250-3     Document Type: Article

References (8)

1. J. Berstel, Axel Thue's work on repetitions in words, in: P. Leroux, C. Reutenauer (Eds.), Séries formelles et combinatoire algébrique, Publications du LaCIM, Université du Québec a Montréal, 1990, pp. 65-80.
2. A. Carpi, On abelian power-free morphisms, Int. J. Algebra Comput. 3 (1993) 151-167.
3. A. Carpi, On the number of Abelian square-free words on four letters, Discrete Appl. Math. 81 (1998) 155-167.
4. F.M. Dekking, Strongly nonrepetitive sequences and progression-free sets, J. Combin. Theory, Ser. A 27 (1979) 181-185.
5. P. Erdos, Some unsolved problems, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961) 221-264.
6. A.A. Evdokimov, Strongly asymmetric sequences generated by a finite number of symbols, Sov. Math. Dokl. 9 (1968) 536-539.
7. V. Keränen, Abelian squares are avoidable on 4 letters, in: W. Kuich (Ed.), Proc. ICALP '92, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 41-52.
8. P.A.B. Pleasants, Nonrepetitive sequences, Proc. Cambridge Phil. Soc. 68 (1970) 267-274.