0 votes 0 votes Show that there exists an algorithm to determine whether or not $w ∈ L_1 − L_2$, for any given $w$ and any regular languages $L_1$ and $L_2$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 259 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.