The Complexity of the Inequivalence Problem for Regular Expressions with Intersection.
Martin FürerPublished in: ICALP (1980)
Keyphrases
- regular expressions
- pattern matching
- query language
- finite automata
- semistructured data
- deterministic finite automata
- regular languages
- tree automata
- conjunctive regular path queries
- xml schema
- regular path queries
- np complete
- lower bound
- computational complexity
- decision problems
- object oriented
- relational databases