A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length 
a. no greater than 2^(i+1) 
b. no greater than 2^i
c. no greater than 2^(i–1)
d. no greater than i
Answer:no greater than 2^(i–1)

Similar Questions:

View All Questions on: Theory of Computation(TOC)

Start The Conversation: