Tore Koss

activity

20202026

most citedEfficiently Testing Simon's Congruence

8 citations · 11 across the 9 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…

cs.DS2023★ 1 cited

Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß +2

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the d…

k-Universality of Regular Languages

Matching Patterns with Variables Under Simon's Congruence

Longest Common Subsequence with Gap Constraints

$k$ -Universality of Regular Languages