1 citations · 5 across the 7 of their papers we have counts for
16 papers
-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…
--Factorization and the Binary Case of Simon's Congruence
Pamela Fleischmann, Jonas Höfer, Annika Huch +1
In 1991 Hébrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or…
On the Self Shuffle Language
Pamela Fleischmann, Tero Harju, Lukas Haschke +2
The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shu…
m-Nearly k-Universal Words -- Investigating Simon Congruence
Pamela Fleischmann, Lukas Haschke, Annika Huch +2
Determining the index of the Simon congruence is a long outstanding open problem. Two words and are called Simon congruent if they have the same set of scattered factors, w…
The Show Must Go On -- Examination During a Pandemic
Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka
When unexpected incidents occur, new innovative and flexible solutions are required. If this event is something such radical and dramatic like the COVID-19 pandemic, these solution…
Scattered Factor Universality -- The Power of the Remainder
Pamela Fleischmann, Sebastian Bernhard Germann, Dirk Nowotka
Scattered factor (circular) universality was firstly introduced by Barker et al. in 2020. A word is called -universal for some natural number , if every word of length $k…
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…
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…
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…
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…
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…
Repetition avoidance in products of factors
Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let be the su…