Theory of Computation (3160704) MCQs

MCQs of Regular Languages and Finite Automata

Showing 61 to 65 out of 65 Questions
4 5 6 7
61.
There exists a language L. We define a string w such that x∈L and x=uvw and |x| >=n for some constant integer n. What can be the maximum length of the substring uv i.e. |uv|<=?
(a) n
(b) |v|
(c) |u|
(d) none of the mentioned
Answer:

Option (a)

62.
Answer in accordance to the third and last statement in pumping lemma: For all _______ xyiz ∈L
(a) i>0
(b) i<0
(c) i<=0
(d) i>=0
Answer:

Option (d)

63.
NFA is not closed under:
(a) Union
(b) Intersection
(c) Concatenation
(d) None of the mentioned
Answer:

Option (d)

64.
If L1′ and L2′ are regular languages, then L1.L2 is:
(a) Regular
(b) May be regular
(c) Non regular
(d) Context free
Answer:

Option (a)

65.
Which of following is regular?
(a) String of 0’s whose length is a perfect square
(b) Strings of 0’s, whose length is prime number.
(c) Set of all palindromes made up of 0’s and 1’s.
(d) Strings of odd number of zeros.
Answer:

Option (d)

Showing 61 to 65 out of 65 Questions
4 5 6 7