Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE IT 2006 | Question 29

  • Last Updated : 28 Jun, 2021

Consider the regular grammar below
S → bS | aA | ϵ
A → aS | bA
The Myhill-Nerode equivalence classes for the language generated by the grammar are
(A) {w ∊ (a + b)* | #a(w) is even) and {w ∊ (a + b)* | #a(w) is odd}
(B) {w ∊ (a + b)* | #a(w) is even) and {w ∊ (a + b)* | #b(w) is odd}
(C) {w ∊ (a + b)* | #a(w) = #b(w) and {w ∊ (a + b)* | #a(w) ≠ #b(w)}
(D) {ϵ}, {wa | w ∊ (a + b)* and {wb | w ∊ (a + b)*}


Answer: (A)

Explanation: 2006_29

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!