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