0 votes 0 votes Recursive Enumerable Languages are NOT closed under : Union Intersection Complement Homomorphism Theory of Computation tbb-toc-1 + – Bikram asked Nov 26, 2016 • edited Aug 17, 2019 by go_editor Bikram 225 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes Recursively Enumerable languages were not closed under complementation . Option C is correct . see this https://www.quora.com/Why-are-recursively-enumerable-languages-not-closed-under-complementation Bikram answered Jul 16, 2017 • selected Aug 17, 2019 by Bikram Bikram comment Share Follow See all 0 reply Please log in or register to add a comment.