Chapter 1 Review: Regular Languages

Major Topics

The following are equivalent and can be used to show that a language is regular:

To show that a language is not regular, use the pumping lemma.

Midterm Logistics

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.

In-Class Notes

Valid XHTML 1.0!