Unit-2 Obtain an NFA to accept the following language L = {w | w ababn or � aban where n � 0} Convert the following NFA into an equivalent DFA. 1 ε P.T. Let R be a regular expression. Then there exists a finite automaton M = (Q, q0, A) which accepts L(R). �, �, (a) Obtain grammar to generate string consisting of any number of a’s and b’s with at least one b. Obtain a grammar to generate the following language: L ={WWR • where W�{a, b}*} (a) Obtain a grammar to generate the following language: L = { 0m 1m2n | m>= 1 and n>=0} Obtain a grammar to generate the set of all strings with no more • than three a’s when = {a, b} � Obtain a grammar to generate the following language: L = { w | n a(w) > n b(w) } L = { an bm ck | n+2m = k for n>=0, m>=0}
Unit-2 Obtain an NFA to accept the following language L = {w | w � ababn or aban where n � 0} Convert the following NFA into an equivalent DFA. 1 ε P.T. Let R be a regular expression. Then there exists a finite automaton M = (Q, �, �, q0, A) which accepts L(R). (a) Obtain grammar to generate string consisting of any number of a’s and b’s with at least one b. • Obtain a grammar to generate the following language: L ={WWR where W�{a, b}*} (a) Obtain a grammar to generate the following language: L = { 0m 1m2n | m>= 1 and n>=0} • Obtain a grammar to generate the set of all strings with no more than three a’s when � = {a, b} Obtain a grammar to generate the following language: L = { w | n a(w) > n b(w) } L = { an bm ck | n+2m = k for n>=0, m>=0}