most citedUnary Patterns of Size Four with Morphic Permutations

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

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…