1
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
For Σ = {a, b}, let us consider the regular language L = {x | x = a2+3k or x = b10+12k, k ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?
A
9
B
5
C
24
D
3
2
GATE CSE 2016 Set 2
Numerical
+1
-0
The number of states in the minimum sized $$DFA$$ that accepts the language defined by the regular expression $${\left( {0 + 1} \right)^ * }\left( {0 + 1} \right){\left( {0 + 1} \right)^ * }$$\$
is ___________________.
Your input ____
3
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Language $${L_1}$$ is defined by the grammar: $$S{}_1 \to a{S_1}b|\varepsilon$$
Language $${L_2}$$ is defined by the grammar: $$S{}_2 \to ab{S_2}|\varepsilon$$

Consider the following statements:
$$P:$$ $${L_1}$$ is regular
$$Q:$$ $${L_2}$$ is regular

Which one of the following is TRUE?

A
Both $$P$$ and $$Q$$ are true
B
$$P$$ is true and $$Q$$ is false
C
$$P$$ is false and $$Q$$ is true
D
Both $$P$$ and $$Q$$ are false
4
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $$0s$$ and two consecutive $$1s?$$
A
$$\left( {0 + 1} \right){}^ * 0011\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 1100\left( {0 + 1} \right){}^ *$$
B
$$\left( {0 + 1} \right){}^ * \left( {00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * \left. {00} \right)} \right.\left( {0 + 1} \right){}^ *$$
C
$$\left( {0 + 1} \right){}^ * 00\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 11\left( {0 + 1} \right){}^ *$$
D
$$00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * 00$$
GATE CSE Subjects
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12
© ExamGOAL 2024