in Theory of Computation
182 views
0 votes
0 votes
The $min$ of a language $L$ is defined as

          $min(L)=$ {$w∈L:$ there is no $u∈L,v∈Σ^+,$ such that $w=uv$}

Show that the family of regular languages is closed under the $ min$ operation.
in Theory of Computation
182 views

Please log in or register to answer this question.

Related questions