Q1. The following statement is related to which theorem? "All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies. within the same language.” A. Turing Machine B. Arden’s theorem C. Pumping Lemma D. None of the above SHOW ANSWER C. Pumping LemmaQ42. If we select a string w such that wEL, and w=uvw Which of the following portions cannot be an empty string? A.u B. Vv C.w D. all of the above SHOW ANSWERQ3. There exists a language L. We define a string w such that wEL and w=xyz and |w| >=n for some constant integer n. What can be the maximum length of the substring xy Le. |xy| = {0,1} in which all strings that beings and ends with 0 is-------- A. 0(0+1)0 B. 00 C. 00(0+1)0 D. 00(0+1)11 SHOW ANSWER A. 0(0+1)0Q8. The set of all strings over ¥ = {a,b} in which all strings that starts with and ends with same letter is---- A[a(atb)*b + b(a+b)*a] [a(a+b)*a + b(atb)*b] C. a(atb)*a D. b(a+b)*b SHOW ANSWER B. [a(a+b)*a + b(atb)*b]Q9. Which of the following does the given Mealy machine represents? on 1/0 A.1's Complement 2’s Complement C. 10's Complement 9’s Complement SHOW ANSWER A. 1's ComplementQ10. The number of elements present in the e-closure(A) in the given diagram. A.1 SHOW ANSWERQ.11. Which of the following will not be accepted by the following DFA? A. ababaabaa B. abbbaa C abbbaabb D. abbaabbaa SHOW ANSWER A. ababaabaaQ12. Which among the following is the missing transition in the given DFA? L= {xey= {a, b} | x starts with a and ends with b} A. & (q0, a) =q0 B. 6 (F, a) =D C. 8 (F, a) =ql D.s (qi, a) =D SHOW ANSWER C. 6 (F, a) =qlQ.13. Reverse of a DFA can be formed by---- A. using PDA B. making final state as non-final C. making final as starting state and starting state as final state D. None of the above. SHOW ANSWER C, making final as starting state and starting state as final stateQ14. The language accepted by this DFA is--- A. b*ab*ab*ab* B. (atb)* Cc. b*a(at+b)* D. b*ab*ab* SHOW ANSWER C. b¥a(at+b)*Q15. The minimum state automaton equivalent to the below FSA has the following number of states---- SHOW ANSWER B.2