1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
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 \,\,\,\,Otherwise} \cr } } \right.$$
$$L = \left\{ {\matrix{ {{{\left( {0 + 1} \right)}^ * }\,\,\,if\,\,P = NP} \cr {\,\,\,\,\,\,\,\phi \,\,\,\,Otherwise} \cr } } \right.$$
Which of the following statement is true?
2
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
If the strings of a language $$L$$ can be effectively enumerated in lexicographic (i.e., alphabetic$$(c)$$ order, which of the following statements is true?
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Regarding the power of recognition of languages, which of the following statement is false?
4
GATE CSE 1992
True or False
+1
-0
Which of the following statements is / are true / false?
Union of two recursive languages is recursive
Questions Asked from Recursively Enumerable Language and Turing Machine (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages