A Regular Expression Matching Circuit Based on a Decomposed Automaton.
Hiroki NakaharaTsutomu SasaoMunehiro MatsuuraPublished in: ARC (2011)
Keyphrases
- regular expressions
- pattern matching
- deterministic finite automata
- approximate matching
- finite automata
- matching algorithm
- string matching
- finite state machines
- semistructured data
- graph matching
- edit distance
- cost model
- suffix tree
- record linkage
- query language
- database
- static analysis
- high speed
- approximate string matching
- xml schema
- regular languages
- data sets