- https://en.wikipedia.org/wiki/Levenshtein_automaton
- is a: 'Finite-state machine'
- domain: 'Automata theory'
- applications: 'Approximate string matching', 'Spellchecking'
- also called: 'Directed acyclic word graph', 'DAWG'
- https://en.wikipedia.org/wiki/Suffix_automaton
- is a: 'Deterministic finite automaton'
- domain: 'Automata theory'
- applications: 'Approximate string matching'
- is a: 'Replicant'
- also called: 'String-Edit-Distance-automaton"
- paper: 'A fast algorithm for finding the nearest neighbor of a word in a dictionary'