Binary words avoiding the pattern AABBCABBA

DOI10.1051/ITA/2010010MaRDI QIDQ5190083zbMATH OpenOpenAlexFDO

Authors Pascal Ochem

Publication date 12 March 2010

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/44617, https://semanticscholar.org/paper/fc14cb05e6d4294dc09f8806eb4390c3302d1d9d

zbMATH Keywords

combinatorics on wordsfactor complexityletter frequency

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• BINARY PATTERNS IN BINARY WORDS
• scientific article; zbMATH DE number 2087216
• Computing the partial word avoidability indices of binary patterns
• scientific article; zbMATH DE number 4035171
• Every binary pattern of length greater than 14 is abelian-2-avoidable

Cites work

• A generator of morphisms for infinite words
• BLOCKING SETS OF TERMS
• Combinatorial Complexity of Regular Languages
• Efficient lower bounds on the number of repetition-free words
• Growth of repetition-free words -- a review
• Growth problems for avoidable words
• Letter frequency in infinite repetition-free words

Cited in

(4)

• Avoidability of formulas with two variables
• More characterizations of morphic words
• Avoidability of formulas with two variables
• Characterization of some binary words with few squares

This page was built for publication: Binary words avoiding the pattern AABBCABBA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190083)