Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

share|cite|improve this question
up vote 4 down vote accepted

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.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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