There was a problem sending you an sms. Check your phone number or try again later.
We've sent a link to the Scribd app. If you didn't receive it, try again.
A -> 0A | 0B | 1B
B -> 1B | 0C | e
C -> 0B | 1A
and consider the string s=1p0p12p. Now we try to break it up into s=xyz.
Since |xy|<=p and |y|>0, y can only contain 1s. When we pump the string
once we get xy2z = 1p+|y|0p12p which is not in the language. This contradicts
the pumping lemma, so the language is not regular.
c. The set of strings where each string has an equal number of 0?s and 1?s, and every prefix of the string has at most one more 0 than 1, and at most one more 1 than 0.
strings of even length. Since L and this DFA are both regular, and regular sets are closed under intersection, regular sets must also be closed under Even.
Triple(A) has the form 0n10n10n1 where n>=0. If we assume pumping
length p and try to pump the string s=0p10p10p1 which is in this language,
we get s=0p+|y|10p10p1 which is not. Since A is regular and Triple(A) is not,
the set of regular languages is not closed under Triple.
Now bringing you back...
Does that email address look wrong? Try again with a different email.