in Theory of Computation
150 views
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.
in Theory of Computation
150 views

Please log in or register to answer this question.

Related questions