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

Related questions

0 votes
0 answers
2
asked Aug 27, 2018 in Operating System by Avik Chowdhury Junior (621 points) | 16 views
+1 vote
0 answers
4
+1 vote
0 answers
5
asked Nov 6, 2018 in Algorithms by nag.swarna (171 points) | 87 views
0 votes
0 answers
6
asked Jan 1, 2017 in Computer Networks by Vaishali Trivedi Junior (811 points) | 31 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
49,823 questions
54,818 answers
189,570 comments
80,991 users