1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
GATE CSE 2009 Theory of Computation - Finite Automata and Regular Language Question 53 English

The above $$DFA$$ accepts the set of all strings over $$\left\{ {0,\,\,1} \right\}$$ that

A
Begin either with $$0$$ or $$1$$
B
End with $$0$$
C
End with $$00.$$
D
Contain the substring $$00.$$
2
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is FALSE?
A
There is a unique minimal $$DFA$$ for every regular language
B
Every $$NFA$$ can be converted to an equivalent $$PDA$$
C
Complement of every context free language is recursive
D
Every non deterministic $$PDA$$ can be converted to an equivalent deterministic $$PDA$$
3
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
$$S \to aSa\,\left| {\,bSb\,\left| {\,a\,\left| {\,b} \right.} \right.} \right.$$
The language generated by the above grammar over the alphabet $$\left\{ {a,\,b} \right\}$$ is the set of
A
All palindromes
B
All odd length palindromes
C
Strings that begin and with same symbol
D
All even length palindromes
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12