same as: https://gateoverflow.in/112604/ugc-net-jan-2017-paper-3-q-22

is it D?

The Gateway to Computer Science Excellence

+1 vote

Let $G = (V, T, S, P)$ be a context-free grammar such that every one of its productions is of the form $A \rightarrow ν$, with $|ν| = k > 1$. The derivation tree for any string $W \in L (G)$ has a height such that

- $h < \frac{(|W|-1)}{k-1}$
- $\log_{k} |W| \leq h$
- $\log_{k} |W| < h < \frac{(|W|-1)}{k-1}$
- $\log_{k} |W| \leq h \leq \frac{(|W|-1)}{k-1}$

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,644 questions

56,512 answers

195,560 comments

101,074 users