A Compact Proof of Decidability for Regular Expression Equivalence.
Andrea AspertiPublished in: ITP (2012)
Keyphrases
- regular expressions
- query containment
- pattern matching
- query language
- description logics
- finite automata
- semistructured data
- xml schema
- deterministic finite automata
- regular path queries
- decision procedures
- theorem prover
- cost model
- matching algorithm
- static analysis
- theorem proving
- string matching
- databases
- query answering
- first order logic
- data model