0 votes 0 votes Let $L$ be any regular language on $Σ =$ {$a, b$}. Show that an algorithm exists for determining if $L$ contains any strings of even length. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 182 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.