Closure properties and descriptional complexity of deterministic regular expressions.
Katja LosemannWim MartensMatthias NiewerthPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- regular expressions
- tree automata
- closure properties
- deterministic finite automata
- context free grammars
- pattern matching
- finite automata
- query language
- xml schema
- regular languages
- conjunctive regular path queries
- matching algorithm
- finite state
- data mining
- regular path queries
- decision problems
- expressive power
- data analysis