88 CHAPTER Transition Graphs abb Even if we restrict labels to strings of only one letter or these two equivalent situations: 10 We have already seen that in a TG a particular string of input letters may trace through the machine on different paths, depending on our choice of grouping. For instance, abb can go from state 3 to 4 or 5 in the middle of the three preceding examples, depending on whether we read the letters two and one or all three at once. The ultimate path through the machine is not determined by the input alone. Therefore, we say this machine is nondeter does not mae all its own determinations. PROBLEMS 3. 1. For each of the five FAs pictured in Problems 17, 19, and 20 in Chapter 5, build a transi tion graph that accepts the same language but has fewer states. 2. For each of the next 10 words, decide which of the six machines on the next page accep the given word. 5, i) A (ii) a (iv) aa (v) ab (vi) aba (vii) abba (vii) bab (ix) baab (x) abbb 7