Consider the regular grammar below $S \rightarrow bS \mid aA \mid \epsilon $ $A \rightarrow aS \mid bA$ The Myhill-Nerode equivalence classes for the language generated by the grammar are $\{w \in (a + b)^* \mid \#a(w) \text{ is even) and} \{w \in (a + b)^* \mid \#a(w) \text{ is odd}\}$ ... $\{\epsilon\},\{wa \mid w \in (a + b)^* \text{and} \{wb \mid w \in (a + b)^*\}$

asked
Apr 18, 2020
in Theory of Computation
admin
573 points
8 views