Tore Koss

activity

20202025

most citedMatching Patterns with Variables Under Simon's Congruence

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

collaborators

Showing cs.FLShow all

5 papers · 1 filter

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

Subsequence Matching and Analysis Problems for Formal Languages

Szilárd Zsolt Fazekas, Tore Koß, Florin Manea +2

In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succin…

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

Efficiently Testing Simon's Congruence

Pawel Gawrychowski, Maria Kosche, Tore Koss +2

Simon's congruence $\sim_{k}$ is defined as follows: two words are $\sim_{k}$ -equivalent if they have the same set of subsequences of length at most $k$ . We propose an algorithm which…