0 votes 0 votes Show that if the statement “If $L_1$ is regular and $L_1 ∪ L_2$ is also regular, then $L_2$ must be regular“ were true for all $L_1$ and $L_2$, then all languages would be regular. 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 146 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.