Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

conceptual trick

GATE CSE & IT · Turing Machines & Computability · 2003-2003

1
PYQs
100%
keyed
0
elite explanations
1
years appeared

Study anchor

Hopcroft-Ullman / Dragon Book

Automata, languages, parsing, syntax-directed translation

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2003 PYQ

Nobody knows yet if $$P=NP$$. Consider the language $$L$$ defined as follows $$L = \left\{ {\matrix{ {{{\left( {0 + 1} \right)}^ * }\,\,\,if\,\,P = NP} \cr {\,\,\,\,\,\,\,\phi \,\,...

mediumanswer key