Homework 3

Details

1. 1.7e
2. 1.7g
3. 1.8b
4. 1.9b
5. 1.10b
6. 1.16b (Show the intermediate automata)
7. 1.32

Further details

For 1.8b, 1.9b, and 1.10b, you may use NFAs for the initial languages. Please provide the NFAs/DFAs for the initial language(s) and then show the combined one unsimplified. Then simplify if you wish. For 1.32 providing a DFA/NFA is a proof (see results in the chapter that imply this). I prefer a state diagram for this problem since it is usually much easier to follow than a formal definition or table.