Computer Sciences > Gate 2017 Set-1 > CFG
If G is grammar with productions
where S is the start variable, then which one of the following is not generated by G?
S → SaS | aSb | bSa | SS | ∈
where S is the start variable, then which one of the following is not generated by G?
Explanation
Correct : CFG
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.