b) Describe in words and give a regular expression for the language accepted by the TG of the picture above.

c) Given a TG, called TG1, that accepts the language L1 and a TG, called TG2, that accepts the language L2, show how to build a new TG (called TG3) that accepts exactly the language L1L2.

d) Let the language L be accepted by the transition graph T and let L not contain the word . Show how to build a new TG that accepts exactly all the words in L and the word .

a, ba a