Problem:

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.

Required:

Question 1: One suggestion is to draw an edge from - to + and label it ba show that this does not always work.

Question 2: Another suggestion is to draw a new + state and draw an edge from any - state to it labeled ba. Show that this doesn't always work

Question 3: What does work?

Please show how the transition graph T work.