1
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
The lexical analysis for a modern computer language such as java needs the power of which one of the following machine model in a necessary and sufficient sense?
A
Finite state automata
B
Deterministic pushdown automata
C
Non -deterministic pushdown automata
D
Turing machine
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
4
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
Let $${L_1} = \left\{ {{0^{n + m}}{1^n}{0^m}\left| {n,m \ge 0} \right.} \right\},$$
$$\,\,\,{L_2} = \left\{ {{0^{n + m}}{1^{n + m}}{0^m}\left| {n,m \ge 0} \right.} \right\},$$ and
$$\,\,\,\,{L_3} = \left\{ {{0^{n + m}}{1^{n + m}}{0^{n + m}}\left| {n,m \ge 0} \right.} \right\},$$ Which of these languages are NOT context free?
A
$${L_1}$$ only
B
$${L_3}$$ only
C
$${L_1}$$ and $${L_2}$$
D
$${L_2}$$ and $${L_3}$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP