1. Homework #2 J. H. Wang Mar. 29, 2011

2. Homework #2 Chap.3 –3.5 (a) –3.8 (b) –3.16 –3.23 (a)

3. Chap.3 –3.5: Write DFAs that recognize the tokens defined by the following regular expressions: (a) (a|(bc)*d)+ –3.8: Write regular expressions that define the strings recognized by the FAs in Figure 3.33 on page 136. (in the next slide) (b)

5. –3.16: Show the NFA that would be created for the following expression using the technique of Section 3.8: (ab*c)|(abc*) –3.23 Write Lex regular expressions (using character class if you wish) that match the following sets of strings: (a) The set of all unprintable ASCII characters (those before the blank and the very last character)

6. Submission Hand-written exercises: hand in your paper version in class Due: two weeks (Apr. 12, 2011)