0 votes 0 votes CAN SOMEONE EXPLAIN ME WITH AN EXAMPLE THAT WHY DCFL CLOSED UNDER COMPLEMENATION AND CFL NOT CLOSED UNDER COMPLEMENATION? Theory of Computation theory-of-computation closure-property decidability + – sushmita asked Sep 9, 2018 sushmita 179 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Sep 9, 2018 reply Follow Share L = { am . bn . ck | m=n or n=k } ====>CFL, but it's complement is not CFL 0 votes 0 votes Please log in or register to add a comment.