Show that the language containing all binary strings that do not contain the substring bba but have a multiple of three bs is regular.
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.