Florin Manea

activity

20092026

most citedTesting k-binomial equivalence

14 citations · 52 across the 22 of their papers we have counts for

collaborators

35 papers

cs.DS2026

Tractable Gap-Constraint Languages for Complex Event Recognition

Antoine Amarilli, Florin Manea, Tina Ringleb +1

For strings $u, D \in Σ^{*}$ , a subsequence embedding of $u$ in $D$ is a function $e : {1, 2, \dots, ∣ u ∣} \to {1, 2, \dots, ∣ D ∣}$ with $e (i) < e (i + 1)$ for every $i \in \{1,2,…

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.LO2023★ 1 cited

Semënov Arithmetic, Affine VASS, and String Constraints

Andrei Draghici, Christoph Haase, Florin Manea

We study extensions of Semënov arithmetic, the first-order theory of the structure $(N, +, 2^{x})$ . It is well-knonw that this theory becomes undecidable when extended with…

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…

cs.LO2022

A Generic Information Extraction System for String Constraints

Joel D. Day, Adrian Kröger, Mitja Kulczynski +3

String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of…