157 citations · 284 across the 16 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2019★ 8 cited
A Trichotomy for Regular Trail Queries
Wim Martens, Matthias Niewerth, Tina Popp
Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for pat…
cs.FL2014★ 7 cited
A Characterization for Decidable Separability by Piecewise Testable Languages
Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen +2
The separability problem for word languages of a class by languages of a class asks, for two given languages and from , whether the…
cs.FL2013
Efficient Separability of Regular Languages by Subsequences and Suffixes
Wojciech Czerwiński, Wim Martens, Tomáš Masopust
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and…