3 votes 3 votes Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is correct? Both (i) and (ii) are false Both (i) and (ii) are true (i) is true, (ii) is false (i) is false, (ii) is true Theory of Computation ugcnetcse-jan2017-paper3 theory-of-computation regular-language + – go_editor asked Mar 24, 2020 • edited Jan 30 by makhdoom ghaya go_editor 2.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply Sanjay Sharma commented May 14, 2020 reply Follow Share A intersection B = (A'UB')' . since set is closed under complement and union so it must be closed under intersection so a is true ( union and complement-> intersection no such relation between union , intersection --> complementation 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes FIRST STATEMENT IS TRUE REGULER,CSL,RECURSIVE CLOSED UNDER UNION AND COMPLEMENTATION AND THESE ARE ALSO CLOSED UNDER INTERSECTION SECOND STATEMENT IS FALSE RE CLOSED UNDER UNION AND INTERSECTION HAS BUT NOT CLOSED UNDER COMPLEMENTATION Mohit Kumar 6 answered May 5, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option C) is correct. Sanandan answered Oct 3, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L1 $\cup$ ~(L2) = L1 $\cap$ L2 here we can tell about intersection using union and complementation. but we can’t tell about complementation using union and intersection. hence C is correct option. thearpit1 answered Oct 19, 2023 thearpit1 comment Share Follow See all 0 reply Please log in or register to add a comment.