The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
24 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
asked in Theory of Computation by Loyal (8k points)
closed by | 24 views
+1

Related questions

0 votes
0 answers
2
asked Aug 27 in Operating System by Avik Chowdhury Junior (837 points) | 14 views
+1 vote
0 answers
4
asked Jan 23, 2017 in Algorithms by Akriti sood Boss (13.7k points) | 91 views


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,284 questions
49,774 answers
164,289 comments
65,856 users