Recognition of an Approximate Occurrence of Words on a Turing Machine in Real Time

New Approaches in Classification and Data Analysis

“…Ivanov (1985) constructed a multi-head Turing machine which in real time solved the string matching problem with k mismatches The automaton strategy (i.e., construct an automaton in step 1 to scan text in step 2) has been used in algorithms for approximate string matching problems.…”

Efficient Algorithms for Sequence Analysis

“…Masek and Paterson [38] have designed an algorithm that can be thought of as a finite automaton of O(n) states, which finds the edit distance between the pattern and the strings in the database in O(mn/ log n) time. Further speed-ups can be obtained using this automata-theoretic approach [32,55]; however such improvements seem to require automata with exponentially many states, and an exponentially large preprocessing time to construct the automata; therefore they are only of theoretical interest, and are only applicable when m is much smaller than n.…”