Binary words avoiding the pattern AABBCABBA

DOI10.1051/ita/2010010zbMath1184.68377OpenAlexW1985087922MaRDI QIDQ5190083

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

zbMATH Keywords

combinatorics on wordsfactor complexityletter frequency

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Avoidability of formulas with two variables ⋮ Avoidability of Formulas with Two Variables ⋮ Characterization of some binary words with few squares

Cites Work

• Unnamed Item
• Growth problems for avoidable words
• Letter frequency in infinite repetition-free words
• Growth of repetition-free words -- a review
• A generator of morphisms for infinite words
• Combinatorial Complexity of Regular Languages
• BLOCKING SETS OF TERMS

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