This is Automata Theory question.

Please do not copy the answers from the the same existing problem.

Problem #3: Using the method given in class, construct a NFA that recognizes the language generated by the following regular grammar: Problem #4: Please remove the productions frorn the following grammars. (Note that a single E production from the start symbol is allowed.) b) S ADS| AD | ADE E- DEAD ! c Problem #5: Please remove the unit productions from the following grammars: a) S D | E | F DaDa E b) S- A|CB A CD C-cClc Problem #6: Convert the following CFG's into CNF a) S SS (S)|E b) S?ABA