0 votes 0 votes The collection of Turing recognizable languages are closed under: Union Intersection Complement Concatenation Star Closure (i) Only Both (i),(iv) (i),(ii),(iv)and(v) All 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 1 comment See all 1 1 comment reply Anjan commented Dec 17, 2017 reply Follow Share REL are not closed under complementation among the options. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option C RE IS NOT CLOSED UNDER COMPLEMENT. https://gatecse.in/closure-property-of-language-families/ Rameez Raza answered Dec 18, 2017 Rameez Raza comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The collection of turing recognizable languages are closed under 1)Union 2)Intersection 3)Concatenation 4)Star closure topper98 answered Mar 19, 2020 topper98 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option C is correct as Recursively enumerable languages 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 1 comment See all 1 1 comment reply Arjun commented Mar 29, 2020 reply Follow Share "every other"? 0 votes 0 votes Please log in or register to add a comment.