Reduced Nondeterministic Finite Automata for Approximate String Matching.
Jan HolubPublished in: Stringology (1996)
Keyphrases
- finite automata
- approximate string matching
- string matching
- regular expressions
- deterministic automata
- grammatical inference
- edit distance
- n gram
- finite automaton
- suffix array
- suffix tree
- indexing techniques
- tree automata
- hidden markov models
- pattern matching
- similarity measure
- machine learning
- sequence databases
- matching algorithm
- building blocks