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. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 5, 2019 Naveen Kumar 3 182 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.