1. Engineering
  2. Computer Science
  3. 2 points prove that regular languages are closed under complements...

Question: 2 points prove that regular languages are closed under complements...

Question details

(2 points) Prove that regular languages are closed under complements. The complement of a regular language, L, denoted Lc, therefore is the set of all strings (from Σ*) that are not in L, or Lc-{ x | x e Σ * and x L }. 5.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution