Computer Sciences > GATE 2024 SET-1 > Chomsky Normal Form
Let G = (V, Σ, S, P) be a context-free grammar in Chomsky Normal Form with Σ = {a, b, c} and V containing 10 variable symbols including the start symbol S. The string w = a30 b30 c30 is derivable from S. The number of steps (application of rules) in the derivation S →* w is
Explanation
Correct : 89
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.