Re: languages

For L ={ z in {0,1,2}* : number of 0's are
equal to number of 1's + number of 2's }

I get a more complicated solution and I was wondering if someone could
tell me if this generation would be complete:

S-> 0A | 1B | 2C | S | lambda
B-> 1B | S | lambda
C-> 2C | S | lambda

.