0 votes 0 votes If $L$ is a regular language, prove that the language {$uv : u ∈ L,υ ∈ L^R$} is also regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 4, 2019 Naveen Kumar 3 226 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes $L$ is Regular so $L^R$ is also regular. and Regular Language is closed under Concatenation so $uv$ is also regular. prashant281188 answered Apr 4, 2019 prashant281188 comment Share Follow See all 0 reply Please log in or register to add a comment.