1
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Let $$L$$ be the language represented by the regular expression $$\sum {^ * 0011\sum {^ * } } $$ where $$\sum { = \left\{ {0,1} \right\}} .$$ What is the minimum number of states in a $$DFA$$ that recognizes $$\overline L $$ (complement of $$L$$)?
A
$$4$$
B
$$5$$
C
$$6$$
D
$$8$$
2
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE?
A
The language $$L = \left\{ {{a^n}\,{b^n}\left| {n \ge 0} \right.} \right\}$$ is regular.
B
The language $$L = \,\,\left\{ {{a^n}\,\left| n \right.\,} \right.$$ is prime$$\left. \, \right\}$$ is regular.
C
The language $$L = \left\{ {w\left| {w\,\,} \right.} \right.$$ has $$3k+1$$ $$b'$$ $$s$$ for some $$k \in N$$ with $$\sum { = \left\{ {a,\,\,b} \right\}\left. \, \right\}} $$ is regular.
D
The language $$L = \left\{ {ww\,\left| {w \in \sum {{}^ * } } \right.} \right.$$ with $$\sum { = \left. {\left\{ {0,\,\,1} \right\}} \right\}} $$ is regular.
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the finite automation in the following figure. GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 74 English

What is the set of reachable states for the input string $$0011?$$

A
$$\left\{ {{q_0},\,{q_1},\,{q_2}} \right\}$$
B
$$\left\{ {{q_0},\,{q_1}} \right\}$$
C
$$\left\{ {{q_0},\,{q_1},\,{q_2},\,{q_3}} \right\}$$
D
$$\left\{ {{q_3}} \right\}$$
4
GATE CSE 2014 Set 3
Numerical
+1
-0
The length of the shortest string NOT in the language (over $$\sum { = \left\{ {a,\,\,b} \right\}} $$) of the following regular expression is ____________. $$$a{}^ * b{}^ * \left( {ba} \right){}^ * a{}^ * $$$
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
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