closed by
340 views
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

  1. $2^{k+1}-1$
  2. $3.2^{k}-1$
  3. $2^{k+1}+1$
  4. $3.2^{k}+1$
closed by

Related questions

0 votes
0 votes
0 answers
2
Avik Chowdhury asked Aug 27, 2018
118 views
1 votes
1 votes
0 answers
3
Akriti sood asked Jan 23, 2017
463 views
how is statement iv always true??
0 votes
0 votes
1 answer
4
DAWID15 asked Dec 22, 2022
506 views
Options:10, 12,14, 16, 18, 2020, 18, 16, 14, 12, 1012, 10, 16, 14, 20, 18NONE