Assignments from Hopcroft, Motwani & Ullman
"An Introduction to Automata Theory, Languages and Computation"

page problems

324  8.1.1b,c
335  8.2.1, 2b,c, 3, 4a,b
343  8.3.2, 3
349  8.4.1, 3, 5, 6, 9
npg  8.6: write TM emulator 
382  9.1.1, 2 (but too easy for HW credit), 4
390  9.2.2, 3, 4, 6
400  9.3.2, 3, 6
435  10.1.2, 3, 4 (b might be hard, Euler's Thm may help), 6
447  10.2.1, 2
458  10.3.1, 2, 3
473  10.4.* do any 2 or more that you want.
486  11.1 1, 2