1. Draw a DFA a. for the language accepting strings starting with 'ab' over input alphabets ={a,b} b. Draw a DFA for the language accepting strings starting with '101' over input alphabets ={0,1} c. Draw a DFA that accepts a language L over input alphabets ={0,1} such that L is the set of all strings starting with " 00 '. d. Construct a DFA that accepts a language L over input alphabets ={a,b} such that L is the set of all strings starting with 'aba'. e. Let ={a,b} and let L={baa}. Design a DFA for L. 2. Explain any three applications of DFA,PDA,TM,regular expression 3. Explain regular expression, regular language, context free language, recursively enumerable language 4. Find the regular expression for the set of strings with cither ' p ' preceding a ' q ' or ' q ' preceding a ' p ', over {p,q} 5. Prove that regular languages are closed under intersections (ie) given two regular languages L1 and L2, prove that LI L2 is regular 6. Convert regular expression to DFA a. a(bc) 7. Find the regular expression for DFA 8. Construct a PDA for the following a. Construct a PDA that accepts L={01n0} 9. Difference between Pushdown Automata and Finite Automata 10. Check whether the given grammar G is ambiguous or not. a. SaSbSS S For the string "aabb" bSSSSaSb For w=abba &.SA/BAaAb/abBabB/eForw=ab 11. Explain the following