Dark Mode

Questions by Tauhin Gangwar

0 votes

0 answers

1

all npcomplete
2 problems A and B both are known to be NP-COMPLETE ? Is it possible that we can reduce A to B ??

asked in Theory of Computation Dec 14, 2017

278 views

1 vote

1 answer

2

geeksquiz
Is this grammar is left factored if yes ??? plz explain how

asked in Theory of Computation Feb 5, 2017

345 views

0 votes

1 answer

3

well ordered set
The standard ordering ≤ of any real interval is not a well ordering, since, for example, the open interval (0, 1) ⊆ [0,1] does not contain a least element..plz explain the abovev example...

asked in Set Theory & Algebra Jun 22, 2016

1.6k views

0 votes

1 answer

4

Is the equivalence of two nfa's is Decidable or not? plz explain

asked in Theory of Computation Jun 5, 2016

488 views