18 citations · 84 across the 20 of their papers we have counts for
Showing 2010 · math.COShow all
2 papers · 2 filters
math.CO2010★ 2 cited
Avoiding Abelian powers in binary words with bounded Abelian complexity
Julien Cassaigne, Gwénaël Richomme, Kalle Saari +1
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waer…
math.CO2010
On possible growth of Toeplitz languages
Julien Cassaigne, Anna Frid, Fedor Petrov
We consider a new family of factorial languages whose subword complexity grows as , where is the root of some transcendent equation. Analytical methods and in particula…