Pamela Fleischmann

activity

20182023

most citedMatching Patterns with Variables Under Simon's Congruence

1 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.FL2023

$k$ -Universality of Regular Languages

Duncan Adamson, Pamela Fleischmann, Annika Huch +3

A subsequence of a word $w$ is a word $u$ such that $u = w [i_{1}] w [i_{2}] \dots w [i_{k}]$ , for some set of indices $1 \leq i_{1} < i_{2} < \dots < i_{k} \leq ∣ w ∣$ . A word $w$ is…

cs.FL2023★ 1 cited

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…

math.CO2023★ 1 cited

$α$ - $β$ -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…

k-Universality of Regular Languages

Matching Patterns with Variables Under Simon's Congruence

α-β-Factorization and the Binary Case of Simon's Congruence

$k$ -Universality of Regular Languages

$α$ - $β$ -Factorization and the Binary Case of Simon's Congruence