I can't understand which language does this grammar represent.
L3 = L (G) where G is the grammar defined as G = <Vn, Vt, S, P>, with Vn = {S}, Vt = {0,1} and P the set of productions $S→λ|1S0|0S1|SS$
I can't understand which language does this grammar represent.
L3 = L (G) where G is the grammar defined as G = <Vn, Vt, S, P>, with Vn = {S}, Vt = {0,1} and P the set of productions $S→λ|1S0|0S1|SS$
Hint: This grammar represent the language of all strings with the same number of 0's and 1's.
To prove it notice that any production rule produces such a string. Now argue the converse by taking any string with the same number of 0s and 1s and deduce how it can be constructed using such rules.