Minimal languages. Given a regular language L, show that the set of minimal strings in L is also regular. By minimal, we mean that if x is in L, then xy is not in L for any nonempty string y.
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.