1 1 vote Theory of Computation + – Daniyal89 1.2k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply eyeamgj commented Sep 16, 2018 reply Follow flag d is answer i think 0 0 replyShare Verma Ashish commented Sep 18, 2018 reply Follow flag Any explanation? 0 0 replyShare Please log in or register to add a comment.
0 0 votes The correct ans is d as it will result in empty set which is definitely not recursively ennumerable ShruteeP answered Sep 18, 2018 ShruteeP comment Share Follow See all 8 Comments 8 8 Comments reply Daniyal89 commented Sep 18, 2018 reply Follow flag Is empty string does not belong to RE...I thought epsilon does n`t belong to RE 0 0 replyShare Daniyal89 commented Sep 18, 2018 reply Follow flag Check this link...https://cs.stackexchange.com/questions/84054/are-empty-set-languages-recursively-enumerable 0 0 replyShare Verma Ashish commented Sep 18, 2018 reply Follow flag Check it out https://gateoverflow.in/83694/turing-machine 0 0 replyShare Verma Ashish commented Sep 18, 2018 reply Follow flag Daniyal see this explanation --- https://stackoverflow.com/questions/46140969/how-is-turing-machine-which-accepts-nothing-is-not-recursively-enumerable What is the answer given in your test series.. 0 0 replyShare Daniyal89 commented Sep 18, 2018 reply Follow flag @verma ans is option D 0 0 replyShare Daniyal89 commented Sep 18, 2018 reply Follow flag @verma Am I correctly understanding epsilon belongs to RE empty set does not belong to RE 0 0 replyShare Verma Ashish commented Sep 18, 2018 reply Follow flag @Daniyal89 yes you are right. 0 0 replyShare Daniyal89 commented Sep 18, 2018 reply Follow flag thanku 0 0 replyShare Please log in or register to add a comment.
