Reduced Nondeterministic Finite Automata for Approximate String Matching

Jan Holub. Reduced Nondeterministic Finite Automata for Approximate String Matching. In Proceedings of the Prague Stringology Club Workshop 1996, Prague, Czech Republic, August 14, 1996. pages 19-27, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 1996. [doi]

Authors

Jan Holub

This author has not been identified. Look up 'Jan Holub' in Google