1 citations · 2 across the 11 of their papers we have counts for
7 papers · 1 filter
-word--representable Graphs
Duncan Adamson, Amanita Dietz, Pamela Fleischmann +2
This paper investigates the new notion of -word--repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between tw…
Word Chain Generators for Prefix Normal Words
Duncan Adamson, Moritz Dudey, Pamela Fleischmann +1
In 2011, Fici and Lipták introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the pref…
Word-Representable Graphs and Locality of Words
Philipp Böll, Pamela Fleischmann, Annika Huch +4
In this work, we investigate the relationship between -repre\-sentable graphs and graphs representable by -local words. In particular, we show that every graph representable…
Jumbled Scattered Factors
Pamela Fleischmann, Annika Huch, Melf Kammholz +1
In this work, we combine the research on (absent) scattered factors with the one of jumbled words. For instance, is an absent scattered factor of $\mathtt{cauliflow…
-local Graphs
Christian Beth, Pamela Fleischmann, Annika Huch +4
In 2017 Day et al. introduced the notion of locality as a structural complexity-measure for patterns in the field of pattern matching established by Angluin in 1980. In 2019 Casel…
--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…
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…