Deciding definability by deterministic regular expressions.

Wojciech Czerwinski Claire David Katja Losemann Wim Martens

Published in: J. Comput. Syst. Sci. (2017)

Keyphrases

regular expressions
deterministic finite automata
pattern matching
query language
finite automata
semistructured data
monadic second order logic
xml schema
tree automata
regular languages
regular path queries
context free grammars
matching algorithm
graph databases
database
finite state machines
query evaluation