I need a CFG for the language that contains all strings w in {a,b}* such that the number of a's in w does not equal the number of b's in w. Google does nothing.
Name:
Anonymous2008-11-10 20:42
>>2
This does not generate aaabbba. i.e., it does not generate more than 2 consecutive b's when you want more a's than b's.