Question: 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

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)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!