Due Date: August 3, 2007
EXERCISES
1. Construct DFA's for the regular expression "(a|b)*abb(a|b)*" using Algorithm 3.5 (Construction of a DFA from a regular expression r).
2. Minimize the states in the DFA's of Exercise 1 using Algorithm 3.6 (Minimizing the number of states of a DFA).
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment