Chapter 1 Review: Regular Languages
Major Topics
The following are equivalent and can be used to show that a language is
regular:
- DFAs
- NFAs
- Regular Expressions
- GNFAs
To show that a language is not regular, use the pumping lemma.
Midterm Logistics
- The exam will take place during our regular class period
on Wednesday, February 10th.
- You may bring one 8.5" by 11" sheet of notes.
- Content from all four sections of Chapter 1 will appear.
Extra Office Hour
John will have an extra office hour from 3:30 p.m. - 4:30 p.m.
in EPS 353 on Tuesday, February 9th.
