Regular Expressions with Counting: Weak versus Strong Determinism.
Wouter GeladeMarc GyssensWim MartensPublished in: MFCS (2009)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- regular path queries
- query language
- semistructured data
- xml schema
- regular languages
- deterministic finite automata
- tree automata
- query evaluation
- finite state machines
- databases
- matching algorithm
- conjunctive regular path queries
- graph data
- context free grammars
- domain specific
- database systems