0 votes 0 votes The $head$ of a language is the set of all prefixes of its strings, that is, $head(L)=$ {$x:xy∈L$ for some $y ∈Σ^*$} Show that the family of regular languages is closed under this 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 222 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.