A Simple Binary Expression (SBE) is constructed by non-empty sequences of binary words separated by exactly one +. Examples (Note that an SBE cannot start or end with a +):

11

001+1+01001+11

1+1+11+111+1111

Show that the language of SBEs is regular.