Dominik D. Freydenberger

activity

20152025

most citedTesting k-binomial equivalence

14 citations · 15 across the 4 of their papers we have counts for

collaborators

Showing cs.FLShow all

2 papers · 1 filter

cs.FL2018

Deterministic Regular Expressions With Back-References

Dominik D. Freydenberger, Markus L. Schmid

Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractabili…

cs.FL2015★ 14 cited

Testing k-binomial equivalence

Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki +2

Two words $w_{1}$ and $w_{2}$ are said to be $k$ -binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_{1}$ and $w_{2}$ appears as a scattered facto…