# Recent questions tagged regular-grammar

if language is finite then dfa possible irrespective of comparison between symbols exist or not.is it true??
Hi, I do not succeed in this question: Need to construct a right-linear grammar Would appreciate help :)
L =. a^i b^2j | i,j>=1 is regular or not ?
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... in $X_0$? $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
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)^*\}$
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$