$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\le i_1<i_2<\cdots <i_k\le |w|$. A word $w$ is…