what is a string in the language of(0^* 10^+)^+.
My answer is:
accepted string: 00001010
I think it is wrong?
what is a string that is not in the language of(0^* 10^+)^+.
Design a regular expression that accepts the language of all binary strings with exactly one occurrence of aa.
my answer is:
L1 = { aa, ab, ba, bb}
R = aa + ab + ba + bb
= a(a + b) + b(a + b)
= (a + b) (a + b)
My answer is:
accepted string: 00001010
I think it is wrong?
what is a string that is not in the language of(0^* 10^+)^+.
Design a regular expression that accepts the language of all binary strings with exactly one occurrence of aa.
my answer is:
L1 = { aa, ab, ba, bb}
R = aa + ab + ba + bb
= a(a + b) + b(a + b)
= (a + b) (a + b)