edited by
383 views
0 0 votes

I have a doubt in the proof of  membership problem that is MP = {M # x |  M accepts x }....

here sir is telling that TM N is just a copy cat of TM M....only change is ..reject state of TM M is  connected to accept state of TM N.....so if TM M accepts or rejects x then TM N halts on x....i have understood  this...

My doubt is.....sir is telling that if TM M does not halt on x then TM N rejects x.......but I am not getting how is it possible....because if TM M is looping on x then how TM N can rejects x....also I think that since TM N is some what same like TM M ..then if TM M loops on x then TM N should loops on x....please anyone clarify my doubt....

Thanks in advance.. 

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
1.1k
1.1k views
anujs asked Oct 2, 2024
1,091 views
1) is $\Sigma = \{a,b, \epsilon\}$ possible?2) is $L = \{ab,ba, \epsilon\}$ possible?3) is $\{ \epsilon \}$ a subset of all alphabets or languages?4) is $\phi = \{ \}$ a ...
0 0 votes
0 0 answers
451
451 views
shekabhi.as asked Sep 8, 2024
451 views
given language aibj / i = 2j+1 how to design PDA?
0 0 votes
0 0 answers
210
210 views
arpit.jha asked Jul 31, 2024
210 views
Can we have multiple stack operation on 1 input symbol in PDA ? Like below, here we are pushing 2 a's for 1 i/p aPS: This PDA is a solution to this GATE question https://...
3 3 votes
2 2 answers
1.1k
1.1k views
Jiten008 asked Oct 24, 2023
1,106 views
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?