------------------------------------------------------------------------------ COMP 731 - Data Struc & Algorithms - Lecture 29 - Thursday, September 14, 2000 ------------------------------------------------------------------------------ Today: o String Matching with Finite Automaton No detailed notes available. Material can be found in [CLR]. 1. Definition of the matching problem. 2. Applications of string matching. 3. Brief discussion of approximate string matching. 4. The naive algorithm for string matching. 5. A finite-automaton-based algorithm. 6. How to build the finite automaton. 7. How to represent the finite automaton in a program.