A regular expression matching using non-deterministic finite automaton.
Hiroshi NakaharaTsutomu SasaoMunehiro MatsuuraPublished in: MEMOCODE (2010)
Keyphrases
- regular expressions
- pattern matching
- approximate matching
- deterministic finite automaton
- matching algorithm
- string matching
- finite automata
- xml schema
- semistructured data
- query language
- graph matching
- deterministic finite automata
- edit distance
- approximate string matching
- database
- model checking
- special case
- ordered binary decision diagrams
- reinforcement learning