POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl).
Fahad AusafRoy DyckhoffChristian UrbanPublished in: ITP (2016)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- query language
- semistructured data
- regular languages
- tree automata
- xml schema
- deterministic finite automata
- matching algorithm
- query evaluation
- finite state machines
- theorem proving
- theorem prover
- belief revision
- conjunctive regular path queries
- frequent sequences
- database
- context free grammars
- integrity constraints
- expressive power
- np hard
- relational databases