On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.
Rafaela BastosSabine BrodaAntónio MachiaveloNelma MoreiraRogério ReisPublished in: DCFS (2016)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- finite state machines
- tree automata
- query language
- xml schema
- semistructured data
- regular languages
- query evaluation
- state space
- deterministic finite automata
- decision problems
- regular path queries
- learning algorithm
- matching algorithm
- context free grammars
- optimal policy
- text mining
- object oriented
- conjunctive regular path queries