For set S = { aa ba aba abaab} we have to find a word, whichdoes belong to S* bu

t does not follow the crossing algorithm (crossthe longest factor in S from left
repeatedly, until left with nullstring or non-empty string, which means the wor
d either is in S* ornot).
As an example let's take word abaaba,which is a concatenation of aba and aba. If
we cross out thelongest factor of S from left side, meaning abaab, we are left
witha, which is not a factor of S and cannot be cross out longer. Itwould mean,
that abaaba does not belong to S*, which is faultstatement.