0 votes 0 votes To obtain a string of n Terminals from a given Chomsky normal from grammar, the number of productions to be used is $2n-1$ $2n$ $n+1$ $n^2$ Theory of Computation ugcnetcse-july2018-paper2 theory-of-computation conjunctive-normal-form + – Pooja Khatri asked Jul 13, 2018 recategorized Oct 15, 2018 by Pooja Khatri Pooja Khatri 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Option A. 2n-1 In CNF , the height of the syntax tree is 2n-1 i.e. 2n-1 productions are used to obtain a string on n terminals. yuviabhi answered Aug 29, 2018 yuviabhi comment Share Follow See all 0 reply Please log in or register to add a comment.