Scalable TCAM-based regular expression matching with compressed finite automata.
Kun HuangLinxuan DingGaogang XieDafang ZhangAlex X. LiuKavé SalamatianPublished in: ANCS (2013)
Keyphrases
- finite automata
- regular expressions
- pattern matching
- matching algorithm
- approximate matching
- string matching
- deterministic automata
- probabilistic automata
- regular languages
- finite automaton
- semistructured data
- tree automata
- parallel search
- xml schema
- suffix array
- graph matching
- grammatical inference
- query language
- context free grammars
- deterministic finite automata
- content addressable
- domain knowledge
- ip address
- hidden markov models
- theorem proving
- domain specific
- data mining