Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Abelian pattern avoidance in partial words

F. Blanchet-SadriBenjamin De WinkleSean Simmons — 2014

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, , a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand, Erdős raised the question as to whether there exists an infinite word that avoids abelian squares, , a word...

Page 1

Download Results (CSV)