229 views
0 votes
0 votes
is p and np problem are in syllabus in toc ???

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
mrinmoyh asked Dec 27, 2018
287 views
L1 $\cap$ L2 = $\phi$ This problem is decidable or undecidable in case of CSL, REL, & REnL ????
0 votes
0 votes
0 answers
3
newdreamz a1-z0 asked Dec 22, 2018
448 views
L={ <M | ‘M’ IS A TURING MACHINE AND ‘M’ COMPUTES THE PRODUCT OF TWO NUMBERS }here what can we say about ‘L’?
2 votes
2 votes
1 answer
4
kumar.dilip asked Dec 13, 2018
459 views
If L is CFL then $\bar{L}$ is Recursive. ( True/False)If L is CFL then $\bar{L}$ is RE. (True/Flase).