Rules: Individual work only. Because theory is abstract, there a generally many variations in concrete answers to problems; if I see strangely similar answers, I'll be pretty suspicious!

The problems: Taken from the end of chapter

#1 parts a,b,d -- for part b) just show the trace only of "bbbabb"; state whether this string is accepted or rejected.

#5, 8, 15 -- Remember: DFAs!

#25c, 27, 30, 35 --- for all NFA's you MUST use non-determinism where possible. No fair just making DFAs!
Errata for #27: it should read "contain either aa or bb as substrings". It is not an exclusive OR -- could have both aa and bb substrings.
Note for #35: For the NFA, Sudkamp counts all arcs separately, i.e., a double-labeled arc counts as 2. So my solution NFA has five arcs...one labelled with 2 chars.

#37

To hand in: I'll want a very clean and readable write-up. As theoretical work often involves lots of pondering and erasing I recommend that you (a) work in pencil and (b) use scratch paper to figure it out, then write up the final version neatly.