Computer Science Fundamentals
Algorithms
Subjective
Mar 04, 2013
What are the closure properties of CFL?
Detailed Explanation
- CFL are closed under union, concatenation and Kleene closure.
- CFL are closed under substitution, homomorphism.
- CFL are not closed under intersection, complementation.
- Closure properties of CFL’s are used to prove that certain languages are not Context free.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts