21 views

Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF

1. $2^{k+1}-1$
2. $3.2^{k}-1$
3. $2^{k+1}+1$
4. $3.2^{k}+1$
closed with the note: already exist