Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Recursively enumerable languages are not closed under

Choose the correct answer:

A) union

B) homomorphism

C) complementation

D) concatenation

Detailed Explanation

No Explanation

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback