2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.FL2019
On Modelling the Avoidability of Patterns as CSP
Thorsten Ehlers, Florin Manea, Dirk Nowotka +1
Solving avoidability problems in the area of string combinatorics often requires, in an initial step, the construction, via a computer program, of a very long word that does not co…
math.CO2019★ 2 cited
Unary Patterns of Size Four with Morphic Permutations
Kamellia Reshadi
We investigate the avoidability of unary patterns of size of four with morphic permutations. More precisely, we show that, for the positive integers , the sizes of the alpha…
cs.DM2018
Repetition avoidance in products of factors
Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let be the su…