I have a language $L= \{a^nb^nc^m : n, m \ge 0\}$. Now, I wanted to determine whether this language is linear or not. So, I came up with this grammar: $S \rightarrow A\thinspace|\thinspace Sc$ $A \rightarrow aAb \thinspace | \thinspace \lambda$ I'm pretty ... So, I'm unable to find whether the language is linear or not and what goes wrong in above logic with either case. Please help.

asked
Sep 11
in Theory of Computation
Vimal Patel
199 points
10 views