Abelian-square factors and binary words

2019/07/04 by Salah Triki, Triki, Salah
Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1907.05369

openalex publication_date 2019/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this work, we affirm the conjecture proposed by Gabriele Fici and Filippo Mignosi at the 10th Conference on Combinatorics on Words.

Related

• Words with the Maximum Number of Abelian Squares
• Solved and unsolved problems about abelian squares
• There are exponentially many ternary words that avoid abelian cubes
• On Avoiding Sufficiently Long Abelian Squares
• Fewest repetitions in infinite binary words