Let L denotes the language generated by the grammar S - OSO/00. Which of the following is true?
A) L = O
B) L is regular but not O
C) L is context free but not regular
D) L is not context free
Correct Answer:
Verified
Q12: Let L be a language defined over
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
Q18: Let S and T be language over
Q19: Which of the following pairs have DIFFERENT
Q20: Match all items in Group 1 with
Q21: A minimum state deterministic finite automation accepting
Q22: Any Language generated by an unrestricted grammar
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