# Lecture 7: Regular Expressions and Finite State Automata

### Background Material

### Reading

- Chapter 10 (All sections, but concentrate on Sec. 2, 5, 8) of the text.

### Topics

- Unix Regular Expressions
- Regular Expressions
- Deterministic Finite State Automata and Programs to Recognize Patterns
- From Regular Expressions to Automata
- From Automata to Regular Expressions

### Lecture Notes

### Programs

- Unix Scripts from Section 10.6
- Program in Figure 10.2 (sec. 2)
- Additional program to be added

### Resources

### Assignments

- Assignment 5 -
due by the beginning of class on Mon. Nov. 22 by 10 AM.

Created: Nov. 13, 2004 by jjohnson@cs.drexel.edu