GATE CS 2024 (Forenoon) — Question 59

Theory of Computation (TOC)Context-Free Grammars & Push-Down AutomataNAT2 marksMedium

Let \( G = (V, \Sigma, S, P) \) be a context-free grammar in Chomsky Normal Form with \( \Sigma = \{a, b, c\} \) and \( V \) containing 10 variable symbols including the start symbol \( S \). The string \( w = a^{30} b^{30} c^{30} \) is derivable from \( S \). The number of steps (application of rules) in the derivation \( S \rightarrow^* w \) is ________.
Practise the full 2024-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Context-Free Grammars & Push-Down AutomataTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group