1 citations · 1 across the 2 of their papers we have counts for
3 papers
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…
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…