×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
From the options given below, the pair having different expressive power is
2.
The problem that is undecidable -
3.
The language which is generated by the grammar S-> aSa I bSb I a I b over the alphabet {a, b} is the set of
4.
Two persons X and Y have been asked to show that a certain problem p is NP-complete. X shows a polynomial time reduction from the 3-SAT problem to p and Y shows a polynomial time reduction from p to 3-SAT. From these reduction it can be inferred that
5.
Out of the three problems S, Q and R, S is an NP-complete problem and Q and R are the two other problems not known to be in NP. Which one of the following statements is true if Q is polynomial time reducible to S and S is the polynomial time reducible to R?
6.
From the options given below the statement, which is not necessarily true if X1 is the recursive language and X2 and X3 are the languages that is recursively enumerable but not recursive is
7.
For the language {ap I P is a prime}, the statement which hold true is
8.
The statement that holds true is
9.
The language described by the regular expression (0+1)*0(0+1)*0(0+1)* over the alphabet {0 1} is the set of
10.
3-SAT and 2-SAT problems are