12 citations · 46 across the 32 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2019
New results on pseudosquare avoidance
Tim Ng, Pascal Ochem, Narad Rampersad +1
We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form ), and we complet…
cs.FL2013★ 3 cited
Binary Patterns in Binary Cube-Free Words: Avoidability and Growth
Robert Mercas, Pascal Ochem, Alexei V. Samsonov +1
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are sh…