Assignment #3

Points: 20 pts.
Due Date: July 10, 2007/3:00 PM

RE = (ab|ba)[c-z0-9]*(ab|ba)

1. Create a nondeterministic finite automaton or NFA that will accept a string that is a member of the language generated by L(RE).

2. Convert your NFA N from your exercise 1 into an equivalent DFA D.