Theoretical Computer Science MCQ : Regular Language - Pumping lemma, Closure properties of regular Languages : Link2
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Regular Language - Pumping lemma, Closure properties of regular Languages? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. 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
Q.2. If we select a string w such that w∈L, and w=uvw Which of the following portions cannot be an empty string?
A. u
B. v
C. w D. all of the above
Q.3. There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some constant integer n.What can be the maximum length of the substring xy i.e. |xy|≤?
A. n
B. |y|
C. |x| D. none of the above
Q.4. Fill in the blank in terms of k, where k is the maximum string length in L.
Statement: Finite languages trivially satisfy the pumping lemma by having n = ______
A. k*1
B. k+1
C. k-1
D. none of the above.
Q.5. Which of the following operation can be applied on regular expressions?
A. Union
B. Concatenation
C. Closure
D. All of the above
Q.6. Regular expressions are used to represent which language?
A. Recursive language
B. Regular language
C. Context free language
D. All of the above.
Q.7. The set of all strings over ∑ = {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
Q.8. The set of all strings over ∑ = {a,b} in which all strings that starts with and ends with same letter is--------
A.[a(a+b)*b + b(a+b)*a]
B. [a(a+b)*a + b(a+b)*b]
C. a(a+b)*a
D. b(a+b)*b
Q.9. Which of the following does the given Mealy machine represents?
A. 1’s Complement
B. 2’s Complement
C. 10’s Complement
D. 9’s Complement
Q.10. The number of elements present in the ε-closure(A) in the given diagram.
A. 1
B. 2
C. 3
D. 4
Q.11. Which of the following will not be accepted by the following DFA?
A. ababaabaa
B. abbbaa
C. abbbaabb D. abbaabbaa
Q.12. Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
A. δ (q0, a) =q0
B. δ (F, a) =D
C. δ (F, a) =q1
D. δ (q1, a) =D
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.
Q.14. The language accepted by this DFA is---
A. b*ab*ab*ab*
B. (a+b)*
C. b*a(a+b)*
D. b*ab*ab*
Q.15. The minimum state automaton equivalent to the below FSA has the following number of states----
A. 1
B. 2
C. 3 D. 4