Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 06, 2013

Set of regular languages over a given alphabet set is not closed under

Choose the correct answer:

A) union

B) complementation

C) intersection

D) All of these

Detailed Explanation

Option d is right answer.

Discussion (0)

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

Share Your Thoughts

Feedback