Efficient mapping of nondeterministic automata to FPGA for fast regular expression matching.
Jan KorenekVlastimil KosarPublished in: DDECS (2010)
Keyphrases
- regular expressions
- approximate matching
- finite automata
- pattern matching
- matching algorithm
- string matching
- tree automata
- semistructured data
- query language
- xml schema
- regular languages
- finite state
- finite automaton
- deterministic finite automata
- static analysis
- finite state machines
- hardware implementation
- databases
- cost model
- business intelligence
- data management
- information extraction