recategorized by
2,733 views

1 Answer

Best answer
1 votes
1 votes

Answer A

  • A linear grammar can express an bn but not an bn am bm. Because such a language must need more than one non terminal at right side

L is not linear

L is context free.

  • Push each a in input in a stack.
  • When b encounters in input, pop one element from stack,
  • When all bs are processed and next a comes if stack is empty a m b m is satisfied
  • Similar approach can be used to check a b n

Hence L is context free

selected by
Answer:

Related questions

1 votes
1 votes
0 answers
3
go_editor asked Jul 22, 2016
973 views
Non-deterministic pushdown automaton that accepts the language generated by the grammar: $S \rightarrow aSS \mid ab$ is$\delta (q_0, \lambda , z)= \{ (q_1, z) \}; \delta...