HI All, :D I'm computer science student. Would you like to tell me about that problem? Here.

1) RE for accepts all strings of (a,b,c) that contains an odd number of a's.

2)Re for the language of all binary of strings that have at least three symbols and whose first and last symbols are different.

3)

Simplify the following REs (that is ,find the simpler RE for the same language):

a.(r + Є)*,

b.SS*+Є ,

c.(Є+r)(r+s)*(Є+r),

d.(r+s+rs+sr)*

:blink:

The hint also okay for me.

Thanks.