72 citations · 114 across the 23 of their papers we have counts for
36 papers
-Universality of Regular Languages
Duncan Adamson, Pamela Fleischmann, Annika Huch +3
A subsequence of a word is a word such that , for some set of indices . A word is…
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…
--Factorization and the Binary Case of Simon's Congruence
Pamela Fleischmann, Jonas Höfer, Annika Huch +1
In 1991 Hébrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or…
Decision Problems on Copying and Shuffling
Vesa Halava, Tero Harju, Dirk Nowotka +1
We study decision problems of the form: given a regular or linear context-free language , is there a word of a given fixed form in , where given fixed forms are based on word…
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…
On the Self Shuffle Language
Pamela Fleischmann, Tero Harju, Lukas Haschke +2
The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shu…