p. 164
Figure 4-26(a): The minimized DFA is as follows:
Figure 4-27(c): It is already minimized.
pp. 242 - 243
6.10(a): It is the set of strings consisting of even number of a's and odd number of b's. A DFA that accepts this language is as follows:
6.10(b): It is the set of strings consisting of a's and b's that must end in b and that have two or more b's between two a's separated by b. A DFA that accepts this language is as follows:
