0 votes 0 votes Say L1 and L2 are cfl , is L1 Ex-or L2 is cfl or not? Theory of Computation theory-of-computation + – Aman Juyal asked Oct 5, 2018 Aman Juyal 287 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Utkarsh Joshi commented Oct 6, 2018 reply Follow Share here L1 ex or L2 is (L1 U L2) - (L1 ∩ L2) but CFLs are not closed under intersection so we will not necessarily get a CFL for EX-OR. 0 votes 0 votes Raghav Khajuria commented Oct 6, 2018 reply Follow Share Xor(a, b) =`ab+ab` here a, b both are cfls, as cfls are not closed under complement so move (a`) to csl again csl. Cfl =csl 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1 exor L2=L1.complement(L2) +complement(L1). L2 here given L1 & L2 are Cfl L1 & L2 cfl is not closed under complementation Every cfl is csl csl is closed under complementation therefore answer is not cfl Raghava45 answered Oct 5, 2018 Raghava45 comment Share Follow See all 0 reply Please log in or register to add a comment.