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 2i+1 (b) no greater than 2i (c) no greater than 2i1 (d) no greater than i
Answers
Answered by
1
b no greater than 2i
Similar questions