Beginner
Theory of Computation
Q20 / 100
What is the complement of a language L over alphabet Σ?
Correct! Well done.
Incorrect.
The correct answer is B) Σ* minus L — all strings over Σ not in L
B
Correct Answer
Σ* minus L — all strings over Σ not in L
Explanation
The complement of L is all strings over the same alphabet that are NOT in L. Regular languages are closed under complement; context-free languages are not.
Progress
20/100