High-speed regular expression matching with pipelined automata.
Denis MatousekJan KorenekViktor PusPublished in: FPT (2016)
Keyphrases
- regular expressions
- pattern matching
- high speed
- matching algorithm
- approximate matching
- string matching
- finite automata
- semistructured data
- regular languages
- finite state machines
- query language
- xml schema
- graph matching
- cost model
- regular path queries
- deterministic finite automata
- real time
- approximate string matching
- graph databases
- static analysis
- context free grammars
- text mining
- data analysis