Let the language L be accepted by the transition graph T and let L not contain the word ba. We want to build a new TG that accepts exactly L and the word ba.
(i) One suggestion is to draw an edge from - to + and label it ba. Show that this does not always work.
(ii) Another suggestion is to draw a new + state and draw an edge from any - state to it labeled ba. Show that this does not always work.
(iii) What does work?