Florin Manea

most citedEfficiently Finding All Minimal and Shortest Absent Subsequences in a String

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

collaborators

3 papers

cs.DS2025★ 1 cited

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String

Florin Manea, Tina Ringleb, Stefan Siemer +1

Given a string $w$ , another string $v$ is said to be a subsequence of $w$ if $v$ can be obtained from $w$ by removing some of its letters; on the other hand, $v$ is called an absen…

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…

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String

k-Universality of Regular Languages Revisited

Subsequence Matching and Analysis Problems for Formal Languages

$k$ -Universality of Regular Languages Revisited