CS 390 Homework 5
1. Textbook p. 116
3.20 (e)
2. Textbook pp. 156 - 160
4.1 (b)
4.10 (e)
4.13 all
4.15 (b)
4.16 (a)(d)
3. Read the proof of Theorem 4.2 on pp. 139 - 142 of the textbook and design an algorithm to convert an NFA - Lambda
to NFA.
Due February 23, 2009.
You may discuss these questions among yourselves and/or with me.
But you must write the answers in your own words.