1. For Recursive enumerable languages , we can not draw state diagram
2. CFL is closed under Complement , By making accepting states as rejecting states and vice versa
3. L = { ap | p is prime number } is recursive enumerable language
4. If a language is closed under complement,union then it is closed under intersection
since (L1' ∪ L2')' = L1 ∩ L2