0 votes 0 votes closed with the note: already exist Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF $2^{k+1}-1$ $3.2^{k}-1$ $2^{k+1}+1$ $3.2^{k}+1$ Theory of Computation test-series + – Prateek Raghuvanshi asked Jun 10, 2018 closed Jun 10, 2018 by Prateek Raghuvanshi Prateek Raghuvanshi 340 views comment Share Follow See 1 comment See all 1 1 comment reply akshat sharma commented Jun 10, 2018 reply Follow Share it has been answered already https://gateoverflow.in/36558/nodes-in-a-derivation-tree-for-grammar-in-cnf# 1 votes 1 votes Please log in or register to add a comment.