2 papers
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 Collapsing Prefix Normal Words
Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka
Prefix normal words are binary words in which each prefix has at least the same number of $\so$s as any factor of the same length. Firstly introduced by Fici and Lipták in 2011, th…