6 views

We have not discussed closure properties of the recursive languages or the RE languages other than our discussion of complementation in Section $9.2.2.$ Tell whether the recursive languages and/or the RE languages are closed under the following operations. You may give informal, but clear, constructions to show closure.

1. Union.
2. Intersection.
3. Concatenation.
4. Kleene closure(star).
5. Homomorphism.
6. Inverse homomorphism.
| 6 views