# Question: suppose that l is a language accepted by a transition...

###### Question details

Suppose that L is a language accepted by a transition graph T with one start state and one final state. Also, suppose that L does not contain the word ab. We want to build a new TG that accepts exactly L and the word ab. On the next page, you will find two examples TGs that you may use to help you answer parts (a) and (b), and that you must use in part (c).