764 views

1 Answer

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.
edited by

Related questions

1 votes
1 votes
1 answer
1
learner_geek asked Aug 15, 2017
1,375 views
Is complement of language same type or not decidable by CFL and recursive language or not???Grammar is ambiguous or not?Grammar in regular/CFL/rel decidable or not?