3 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Formal Languages via Theories over Strings
Joel D. Day, Vijay Ganesh, Nathan Grewal +1
We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language…
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…
k-Spectra of weakly-c-Balanced Words
Joel D. Day, Pamela Fleischmann, Florin Manea +1
A word is a scattered factor of if can be obtained from by deleting some of its letters. That is, there exist the (potentially empty) words , and…
The Hardness of Solving Simple Word Equations
Joel D. Day, Florin Manea, Dirk Nowotka
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides…