Show S Recursive Define S M N Dfas L M L N Show S Recursive Q37255308

Show that S is recursive:

Define S = { | M and N are DFAs and L(M) L(N) }. Show that S is recursive.

---

Answer

---

SOLUTION : –

if the problem is completely decidable means there exista halting turing machine which says true when input is valid and nowhen input is not valid.

.This is possible if the problem is solvable.A problemis solvable if there exist a algorithm for it.

is said to be recursive…………..

algorithm for above problem S then S isdecidable.

i).First find Languages described by DFA’s M andN.

ii).After that make DFA of Language ofL(M)intersectsL(N) by cross producting the

OR

 

OR