1. [14 Points] Design a DFA for the language L = {ab n>0} U {bab: n...

Transcribed Image Text:

1. [14 Points] Design a DFA for the language L = {a"b n>0} U {b"ab: n 0}. 2. [14 Points] Show that L = {waw: we (ab)*} is regular. 3. [18 Points] Let L be a language over = {0, 1,2} where each 0 is followed by a 1 or 22. (a) Give a regular grammar that generates L. (b) Convert the regular grammar into an NFA. (c) Give a regular expression for L. 1. [14 Points] Design a DFA for the language L = {a"b n>0} U {b"ab: n 0}. 2. [14 Points] Show that L = {waw: we (ab)*} is regular. 3. [18 Points] Let L be a language over = {0, 1,2} where each 0 is followed by a 1 or 22. (a) Give a regular grammar that generates L. (b) Convert the regular grammar into an NFA. (c) Give a regular expression for L.

Answer rating: 100% (QA)

1 A DFA for the language L an b2 n 0 bn ab n 0 can be designed as follows States q0 91 92 93 Input a... View the full answer