Regular Expressions with Counting: Weak versus Strong Determinism.
Wouter GeladeMarc GyssensWim MartensPublished in: SIAM J. Comput. (2012)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- semistructured data
- regular path queries
- xml schema
- tree automata
- regular languages
- matching algorithm
- query language
- query evaluation
- finite state machines
- context free grammars
- bit parallel
- deterministic finite automata
- frequent sequences
- application domains
- knowledge representation
- data mining
- databases