Do there exist binary strings $A$ and $B$ so that:
- the word $ABAB$ is a cyclic shift of $ABBA$ and
- the word $AB$ does not equal $BA$?
Here $AB$ represents the concatenation of $A$ and $B$.
Do there exist binary strings $A$ and $B$ so that:
Here $AB$ represents the concatenation of $A$ and $B$.
No; note that any cyclic shift of $ABAB$ still has the property that it is some sequence repeated twice. If this is equal to $ABBA$, then the repeated sequence is equal to both $AB$ and $BA$, contradicting that these are different.