3 citations · 3 across the 3 of their papers we have counts for
11 papers
Blocksequences of k-local Words
Pamela Fleischmann, Lukas Haschke, Florin Manea +3
The locality of words is a relatively young structural complexity measure, introduced by Day et al. in 2017 in order to define classes of patterns with variables which can be match…
The Edit Distance to -Subsequence Universality
Pamela Fleischmann, Maria Kosche, Tore Koß +2
A word is a subsequence of another word if can be obtained from by deleting some of its letters. The word with alph is called -subsequence universal i…
Scattered Factor-Universality of Words
Laura Barker, Pamela Fleischmann, Katharina Harwardt +2
A word is a scattered factor of a word if can be obtained from by deleting some of its letters: there exist the (potentially empty) words $v_0,v_1,..,v…
Reconstructing Words from Right-Bounded-Block Words
Pamela Fleischmann, Marie Lejeune, Florin Manea +2
A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of sca…
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…