0 votes 0 votes Exhibit an algorithm for determining whether or not a regular language $L$ contains any string $w$ such that $w^ R ∈ L$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 125 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.