Q-1

(a) For = {a, b}, Build TG for the language defined as words not having number of 2 bs at consecutive places (There should be no string bb in any word). a* (baa*)*(b+).

(b) For = {a, b}, Build TG for the language that is defined as words starting and ending on double letters. (aa+bb)+(aa+bb)(a+b)*(aa+bb)