CMPSCI 251: Mathematics of Computation

David Mix Barrington

Spring, 2007

Discussion Notes #10

from Wednesday 2 May 2007

Practicing Multiple Constructions

In this discussion we are going to practice our constructions underlying Kleene's Theorem by taking a language given by a regular expression and successively producing a λ-NFA, an ordinary NFA, a DFA, a minimized DFA, and a new regular expression. The original regular expression is ab* + (ab)*.

Question text is in black, solutions in blue.

Last modified 3 May 2007