POSIX Lexing with Derivatives of Regular Expressions.
Fahad AusafRoy DyckhoffChristian UrbanPublished in: Arch. Formal Proofs (2016)
Keyphrases
- regular expressions
- pattern matching
- finite automata
- semistructured data
- query language
- tree automata
- xml schema
- deterministic finite automata
- regular languages
- matching algorithm
- query evaluation
- low level
- finite state machines
- context free grammars
- data model
- learning algorithm
- regular path queries
- databases
- database
- np hard
- graph databases
- special case
- data mining