The grammar with production rules S → aSb |SS|λ generates language L given by:
A. L = {w∈ {a, b}* | na (w) = nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
B. L = {w∈ {a, b}* | na (w) = nb (w) and na (v) ≤ nb (v) where v is any prefix of w}
C. L = {w∈ {a, b}* | na (w) ≠ nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
D. L = {w∈ {a, b}* | na (w) ≠ nb (w) and na (v) ≤ nb (v) where v is any prefix of w}
Answer:A
The grammar with production rules S → aSb |SS|λ generates language L given by:
A. L = {w∈ {a, b}* | na (w) = nb (w) and na (v) ≥ nb (v) where v is any prefix of w} B. L = {w∈ {a, b}* | na (w) = nb (w) and na (v) ≤ nb (v) where v is any prefix of w} C. L = {w∈ {a, b}* | na (w) ≠ nb (w) and na (v) ≥ nb (v) where v is any prefix of w} D. L = {w∈ {a, b}* | na (w) ≠ nb (w) and na (v) ≤ nb (v) where v is any prefix of w}