edited by
201 views
0 votes
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.. 

edited by

Please log in or register to answer this question.

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
1 answer
2
gateexplore asked Jun 11, 2023
412 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
0 answers
3
vishnu777 asked Nov 24, 2022
205 views
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
1 votes
1 votes
1 answer
4