Regular expression matching using bit vector automata
Regular expressions (regexes) are ubiquitous in modern software. There is a variety of
implementation techniques for regex matching, which can be roughly categorized as (1) …
implementation techniques for regex matching, which can be roughly categorized as (1) …
Regex matching with counting-set automata
We propose a solution to the problem of efficient matching regular expressions (regexes)
with bounded repetition, such as (ab){1,100}, using deterministic automata. For this, we …
with bounded repetition, such as (ab){1,100}, using deterministic automata. For this, we …
The complexity of evaluating path expressions in SPARQL
K Losemann, W Martens - Proceedings of the 31st ACM SIGMOD …, 2012 - dl.acm.org
The World Wide Web Consortium (W3C) recently introduced property paths in SPARQL 1.1,
a query language for RDF data. Property paths allow SPARQL queries to evaluate regular …
a query language for RDF data. Property paths allow SPARQL queries to evaluate regular …
The complexity of regular expressions and property paths in SPARQL
K Losemann, W Martens - ACM Transactions on Database Systems …, 2013 - dl.acm.org
The World Wide Web Consortium (W3C) recently introduced property paths in SPARQL 1.1,
a query language for RDF data. Property paths allow SPARQL queries to evaluate regular …
a query language for RDF data. Property paths allow SPARQL queries to evaluate regular …
[HTML][HTML] Deterministic regular expressions with back-references
DD Freydenberger, ML Schmid - Journal of Computer and System …, 2019 - Elsevier
Most modern libraries for regular expression matching allow back-references (ie, repetition
operators) that substantially increase expressive power, but also lead to intractability. In …
operators) that substantially increase expressive power, but also lead to intractability. In …
Software-hardware codesign for efficient in-memory regular pattern matching
Regular pattern matching is used in numerous application domains, including text
processing, bioinformatics, and network security. Patterns are typically expressed with an …
processing, bioinformatics, and network security. Patterns are typically expressed with an …
Complexity of decision problems for XML schemas and chain regular expressions
We study the complexity of the inclusion, equivalence, and intersection problem of extended
chain regular expressions (eCHAREs). These are regular expressions with a very simple …
chain regular expressions (eCHAREs). These are regular expressions with a very simple …
Regular expressions with counting: Weak versus strong determinism
We study deterministic regular expressions extended with the counting operator. There exist
two notions of determinism, strong and weak determinism, which are equally expressive for …
two notions of determinism, strong and weak determinism, which are equally expressive for …
A trichotomy for regular trail queries
W Martens, M Niewerth, T Popp - Logical Methods in Computer …, 2023 - lmcs.episciences.org
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 …
queries consider a regular expression r and a directed edge-labeled graph G and search for …
Modeling regex operators for solving regex crossword puzzles
Modeling regular expressions (regexes) has been applied in abundant scenes, but at
present, there is a lack of comprehensive modeling for extended operators, which limits their …
present, there is a lack of comprehensive modeling for extended operators, which limits their …