Login / Signup
Efficient testing and matching of deterministic regular expressions.
Benoît Groz
Sebastian Maneth
Published in:
J. Comput. Syst. Sci. (2017)
Keyphrases
</>
regular expressions
approximate matching
pattern matching
matching algorithm
deterministic finite automata
string matching
query language
semistructured data
regular languages
xml schema
finite automata
tree automata
query evaluation
data model
regular path queries
learning algorithm
database