0 votes 0 votes Theory of Computation decidability bad-question + – monty asked Oct 28, 2016 monty 764 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply monty commented Oct 28, 2016 reply Follow Share @arjun Sir Pls explain 0 votes 0 votes Arjun commented Oct 28, 2016 reply Follow Share What is the source of question? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Here both the languages can be implemented by DFA in Polynomial time So Both are not NPC . NPC problems are very tough problems like:-> https://en.m.wikipedia.org/wiki/List_of_NP-complete_problems So D is Ans. Rajesh Pradhan answered Oct 28, 2016 edited Oct 29, 2016 by Rajesh Pradhan Rajesh Pradhan comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Arjun commented Oct 28, 2016 reply Follow Share So that means we need to know in what form the languages are given here rt? 0 votes 0 votes sudsho commented Oct 28, 2016 reply Follow Share sir we have to know languages or machines accepting them? i mean like regular languages are accepted by both DFA and NFA....means DFA and NFA boh are P?? 0 votes 0 votes Rajesh Pradhan commented Oct 29, 2016 reply Follow Share @arjun sir Yes. 0 votes 0 votes Please log in or register to add a comment.