31 citations · 38 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019
On Solving Word Equations Using SAT
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski +3
We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by refor…
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…