14 citations · 52 across the 22 of their papers we have counts for
5 papers · 1 filter
Matching Patterns with Variables
Florin Manea, Markus L. Schmid
A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching…
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…
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…
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…
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
Katrin Casel, Joel D. Day, Pamela Fleischmann +3
We investigate the locality number, a recently introduced structural parameter for strings (with applications in pattern matching with variables), and its connection to two importa…