Annika Huch

activity

20222026

most citedm-Nearly k-Universal Words -- Investigating Simon Congruence

1 citations · 2 across the 11 of their papers we have counts for

collaborators

Showing cs.FLShow all

5 papers · 1 filter

cs.FL2026

Jumbled Simon's Equivalence and Embeddings

Pamela Fleischmann, Annika Huch, Sungmin Kim +2

\emph{Jumbled scattered factors} are a generalisation of scattered factors (or subsequences) where a jumbled scattered factor is obtained from another word by deleting and rearrang…

cs.FL2026

Witness Languages for Pumping Lemmata

Pamela Fleischmann, Annika Huch, Christian Rauch

In 2022 Dassow and Jecker started investigations on the operational complexity of the pumping constant w.r.t.~two pumping lemmata. Since then, the research on pumping lemmata emerg…

cs.FL2025

$k$ -Universality of Regular Languages Revisited

Duncan Adamson, Pamela Fleischmann, Annika Huch +2

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 \e…

cs.FL2024

Tight Bounds for the Number of Absent Subsequences

Duncan Adamson, Pamela Fleischmann, Annika Huch +3

A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt…

cs.FL2023

$k$ -Universality of Regular Languages