Machine-translated by Google. Questions are authored in English.
Top

Discussion

Consider the following closure properties of regular languages.
1. closed under union
2. closed under concatenation
3. closed under complementation

  • A.1 and 2 only
  • B.All of them
  • C.None of them
  • D.1 only

Answer: B

Correct answer: All of them

Regular languages are closed under all three, and under intersection and difference besides. Union and concatenation follow directly from the regular expression operators; complementation follows from swapping accepting and non-accepting states of a complete DFA; and intersection then follows from the other two by De Morgan, or directly from the product construction.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.