Solved

All NonNull Words of the CFL Can Be Generated by the Corresponding

Question 36

Multiple Choice

All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:


A) String
B) Regular language
C) Null string
D) None of the above

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q31: Which of the following problem is undecidable?<br>A)Membership

Q32: The following CFG is in S ?

Q33: Pumping lemma is generally used for proving

Q34: Match all items in Group 1 with

Q35: Consider the following statements<br>I. Recursive languages are

Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?

Q38: Let S and T be language over

Q39: If PCP is decidable then MPCP is<br>A)Decidable<br>B)Undecidable<br>C)Can't

Q40: The PDA is called non-deterministic PDA when

Q41: FSM can recognize<br>A)Any grammar<br>B)Only CG<br>C)Both (a) and