Is it possible to construct a regular expression that describes all binary strings that have an equal number of occurrences of ab and ba as substrings?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.