Yes, {a,b},L is {w|w contains more 1s than 0s}. Idea: this is similar to the language where the ... a's and b's differ, unioned with all strings not of the form aibj.
This language requires at least two a's in a string. Given that any string of b's can be positioned in front of the first a, behind the second a, or in between the two a's, and given that the regular expression b* can be used to represent any string of b's, b*a b*a b* is a regular expression for this language.
The regular phrase (a + b)* (aa + ba + bb)b)(a + b)* (aa + ba + bb) + a + b + c)b* ab* ad)b* aa b* corresponds to the language of all strings over the alphabet "a, b."
The expression "a,b" =,L i="w|w has more 1s than 0s" Idea: Unioning any strings that are not of the form aibj, this is akin to the language where the... a's and b's differ.
To learn more about String refer to:
brainly.com/question/25324400
#SPJ4
