0 votes 0 votes Let $L_1$ and $L_2$ be regular languages. Is the language $L =$ {$w : w ∈ L_1, w^R ∈ L_2$ necessarily regular? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 12, 2019 Naveen Kumar 3 117 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.