506 views

Find the grammar that generates the language $L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In that grammar what is the length of the derivation (number of steps starring from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$

1. $max (l,m) + 2$
2. $l + m + 2$
3. $l + m + 3$
4. $max (l,m) + 3$
| 506 views
0

https://gateoverflow.in/1856/gate2006_84-85

Part A
by (23 points)
by Loyal (7.1k points)

1
2