The following CFG is in
S ? Abb
B ? bAA
A ? a
B ? b
A) Chomsky normal form but not strong Chomsky normal form
B) Weak Chomsky normal form but not Chomsky normal form
C) Strong Chomsky normal form
D) Greibach normal form
Correct Answer:
Verified
Q13: Let S be an NP-complete problem, Q
Q14: For s ? (0+1)* let d(s) denote
Q15: A FSM can be considered, having finite
Q16: Which of the following statement is true?
A)All
Q17: Recursively enumerable languages are not closed under
A)Complementation
B)Union
C)Intersection
D)None
Q19: The languages -------------- are the examples of
Q20: Let L be any infinite regular language,
Q21: Languages are proved to be regular or
Q22: _ states are called the halt states.
A)ACCEPT
Q23: The part of an FA, where the
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