0 votes 0 votes Let L1 = Φ and L2 = Σ*. Then which of the following is correct? L1 is NP-complete, L2 is not NP-complete L1 is not NP-complete, L2 is NP-complete Both L1 and L2 are NP-complete Neither L1 nor L2 is NP-complete I know the answer is d my query is in solution they are saying that L1 and L2 are P problems but L1 and L2 are undecidable how can they be P? Theory of Computation made-easy-test-series theory-of-computation p-np-npc-nph + – Pankaj Joshi asked Dec 27, 2016 edited Mar 7, 2019 by adeebafatima1 Pankaj Joshi 387 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Arjun commented Dec 27, 2016 reply Follow Share I'm a systems guy but it feels horrible to see a subject gets killed like this :( What is the problem here? How decidable/undecidable? What is P/NP? 0 votes 0 votes Pankaj Joshi commented Dec 27, 2016 reply Follow Share I know the problem should have been formulated better but I think they are talking about completness and emptiness problems. 0 votes 0 votes saurabh rai commented Dec 27, 2016 reply Follow Share it is feel like "suffix" of a question..... :P 0 votes 0 votes Please log in or register to add a comment.