0 votes 0 votes Which of the following problem is undecidable Membership problem for CFL Membership problem for CSL Membership problem for regular set Membership problem for type 0 languages Sanjay Sharma asked Jul 3, 2016 • edited Aug 26, 2016 by go_editor Sanjay Sharma 4.8k views answer comment Share Follow See 1 comment See all 1 1 comment reply ratnesh commented Oct 5, 2019 reply Follow Share D is it right 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes 1)Membership problem for CFL----decidable 2)Membership problem for CSL----decidable 3)Membership problem for regular set====decidable 4)Membership problem for type 0 languages===undecidable page no-7 http://www.cs.colostate.edu/~massey/Teaching/cs301/RestrictedAccess/Slides/301lecture25.pdf plz see https://www.cs.virginia.edu/cs302/classes/class17.pdf Tauhin Gangwar answered Jul 3, 2016 • edited Jul 3, 2016 by Tauhin Gangwar Tauhin Gangwar comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Arjun commented Jul 3, 2016 reply Follow Share No. That does not seem correct. But here you can simply reduce from halting problem and assume it is known as undecidable. 0 votes 0 votes Tauhin Gangwar commented Jul 3, 2016 reply Follow Share ok sir..reduction is right answer... ok i will update...pdf..so that mr. sharma...can understand 1 votes 1 votes Tauhin Gangwar commented Jul 3, 2016 reply Follow Share sharmji ji plz check i have updated one more...pdf..may be it useful 0 votes 0 votes Please log in or register to add a comment.
