0 votes 0 votes Recursive enumerable languages are not closed under _________. Set difference Complement Both (A) and (B) None of the options Theory of Computation nielit2017dec-scientistb theory-of-computation easy recursive-and-recursively-enumerable-languages + – admin asked Mar 30, 2020 retagged Jan 17 by Hira Thakur admin 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes BOTH A and B https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec26.pdf mohitbawankar answered Dec 18, 2017 edited Dec 18, 2017 by mohitbawankar mohitbawankar comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes REL is not closed under complement. A-B = $A\cap( \sim B)$ As Complement is not closed. Set difference is also not closed. Option C. Arnab Bhadra answered Dec 18, 2017 Arnab Bhadra comment Share Follow See 1 comment See all 1 1 comment reply shyamalenduk commented Apr 24, 2020 reply Follow Share But intersection of Recursively enumerable and Recursive language is recursively enumerable. Then A∩(∼B) must be recursively enumerable. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The answer is C as Recursively Enumerable are closed under every other operation except Set difference and Complementation Reference: Recursively Enumerable languages haralk10 answered Mar 29, 2020 haralk10 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Except Set difference and Complementation,Recursive enumerable language satisfies all the remaining closure properties. Answer:opt c keshore muralidharan answered Aug 12, 2020 keshore muralidharan comment Share Follow See all 0 reply Please log in or register to add a comment.