3 votes 3 votes Which of the following are closed/ not closed under infinite Union? a.DCFL b.CFL c.CSL d.Recursive Languages e.Recursively enumerable languages Theory of Computation closure-property theory-of-computation + – Mohammed Sumair asked Oct 14, 2017 Mohammed Sumair 425 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Mohammed Sumair commented Oct 15, 2017 reply Follow Share Please help to get the answer. 0 votes 0 votes sourav. commented Oct 15, 2017 reply Follow Share i think none of them 0 votes 0 votes Mohammed Sumair commented Oct 16, 2017 reply Follow Share Could you please explain. 0 votes 0 votes Please log in or register to add a comment.