1 citations · 4 across the 5 of their papers we have counts for
8 papers · 1 filter
-Universality of Regular Languages
Duncan Adamson, Pamela Fleischmann, Annika Huch +3
A subsequence of a word is a word such that , for some set of indices . A word is…
Matching Patterns with Variables Under Simon's Congruence
Pamela Fleischmann, Sungmin Kim, Tore Koß +4
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computati…
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…
Weighted Prefix Normal Words: Mind the Gap
Yannik Eikmeier, Pamela Fleischmann, Mitja Kulczynski +1
A prefix normal word is a binary word whose prefixes contain at least as many 1s as any of its factors of the same length. Introduced by Fici and Lipták in 2011 the notion of prefi…
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…