Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :

(A) Non regular language of L
(B) Complement of the language L
(C) None of the given
(D) All of above
Correct answer : Option (B) - Complement of the language L

Share

Discusssion

Login to discuss.