Are there languages generated by linear grammer which aren't regular?


Of course. Look at the first example on Wikipedia:

$\qquad S \to aSb \mid \varepsilon$

is linear and generates $\{a^nb^n \mid n \in \mathbb{N}\}$, a non-regular language.

If you mean left-linear, or right-linear, then no - they are equivalent to REG.

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.