We define the minimal words language of $L, \min(L)$, to be the language of all words in $L$ that don't have any prefix in $L$.
Assume $L$ is regular language. I need to prove by building an automaton that $\min(L)$ is regular.
We define the minimal words language of $L, \min(L)$, to be the language of all words in $L$ that don't have any prefix in $L$.
Assume $L$ is regular language. I need to prove by building an automaton that $\min(L)$ is regular.
Hint: Consider a deterministic automaton, if you happen to be at the accepting state, anything that comes later should send you to the "trash" state.