0 votes 0 votes Show that the family of regular languages is closed under finite union and intersection, that is, if $L_1,L_2,…, L_n$ are regular, then $L_U=\bigcup_{i=1,2,..,n}$$L_i$ and $L_I=\bigcap_{i=1,2,3,...,n}L_i$ are also regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 4, 2019 Naveen Kumar 3 157 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
