Question

ТОС Answer any 7 from the followings: 1. Regular expression to NFA: i) ab(aUb)* ii) (aba U a)*ab 2. Explain and construct a generalized NFA, 3. NFA to regular expression 0 3 91 93 8 a 4. DFA to regular expression 011 5. Explain the rules of pumping lemma briefly with an example. 6. Give an example of right linear grammar and left linear grammar. 7. L(G) = {1*20 m >= 1 and >=1}. Construct the language L where, G = {(S.A,B),(1,2).S. (S → AB, A+1A/1,B --232) 8. Grammar G has the following production rule: EXPR [EXPR+EXPR][EXPR*EXPR][EXPR]|a Find out the string 'a+a*a' and check whether the given grammar is ambiguous or not? 9. Convert the following CFG(Context-free grammar) - CNF Chomsky Normal Form). S XYc Xeed YXa 10. Construct a PDA that accepts L = {x"z"|m>0).

ТОС Answer any 7 from the followings: 1. Regular expression to NFA: i) ab(aUb)* ii) (aba U a)*ab 2. Explain and construct a generalized NFA, 3. NFA to regular expression 0 3 91 93 8 a 4. DFA to regular expression 011 5. Explain the rules of pumping lemma briefly with an example. 6. Give an example of right linear grammar and left linear grammar. 7. L(G) = {1*20 m >= 1 and >=1}. Construct the language L where, G = {(S.A,B),(1,2).S. (S → AB, A+1A/1,B --232) 8. Grammar G has the following production rule: EXPR [EXPR+EXPR][EXPR*EXPR][EXPR]|a Find out the string 'a+a*a' and check whether the given grammar is ambiguous or not? 9. Convert the following CFG(Context-free grammar) - CNF Chomsky Normal Form). S XYc Xeed YXa 10. Construct a PDA that accepts L = {x"z"|m>0).

Please answer any 7 of them

Answer 1