论文信息 - On Bispecial Words and Subword Complexity of DOL Sequences

On Bispecial Words and Subword Complexity of DOL Sequences

We study thesubword complexityof a sequence which counts the number of its distinct factors of a given length. Using the technique ofbispecial words, we find an explicit formula for the subword complexity of a wide class of DOL sequences. We also obtain the characterization of bispecial factors and minimalforbidden wordsof that class of sequences.

Sergey V. Avgustinovich | Anna E. Frid

[1] Julien Cassaigne. An Algorithm to Test if a Given Circular HDOL-Language Avoids a Pattern , 1994, IFIP Congress.

[2] Antonio Restivo,et al. Minimal Forbidden Words and Factor Automata , 1998, MFCS.

[3] Jean-Paul Allouche,et al. Sur la complexite des suites in nies , 1994 .

[4] Antonio Restivo,et al. Minimal Forbidden Words and Symbolic Dynamics , 1996, STACS.

[5] Julien Cassaigne. Motifs evitables et regularites dans les mots , 1994 .

[6] Jean-Jacques Pansiot,et al. Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés , 1984, ICALP.

[7] Brigitte Mosse,et al. Properties of words and recognizability of fixed points of a substitution , 1992 .

[8] B. Mossé. Reconnaissabilité des substitutions et complexité des suites automatiques , 1996 .

[9] Veikko Keränen,et al. Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.

[10] Anna E. Frid. On Uniform DOL Words , 1998, STACS.

[11] Julien Cassaigne,et al. Complexité et facteurs spéciaux , 1997 .

[12] M. Lothaire,et al. Combinatorics on words: Frontmatter , 1997 .

[13] Théodore Tapsoba,et al. Automates calculant la complexité de suites automatiques , 1994 .

[14] Gregory Kucherov,et al. Minimal Letter Frequency in n-th Power-Free Binary Words , 1997, MFCS.

[15] Filippo Mignosi,et al. If a D0L Language is k-Power Free then it is Circular , 1993, ICALP.