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:
Verified
Q7: Let the class of language accepted by
Q8: Which of the following statement is wrong?
A)Any
Q9: Grammar that produce more than one Parse
Q10: The language accepted by a Push down
Q11: The PDA is called non-deterministic PDA when
Q13: All NonNull words of the CFL can
Q14: Let L={w (0 + 1)* w has
Q15: Consider the following Finite State Automaton The
Q16: Let L1 be a recursive language. Let
Q17: Let L denotes the language generated by
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents