Duncan Adamson

activity

20242026

collaborators

Showing cs.FLShow all

2 papers · 1 filter

cs.FL2025

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.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…

Tight Bounds for the Number of Absent Subsequences

k-Universality of Regular Languages Revisited

$k$ -Universality of Regular Languages Revisited