0 votes 0 votes If $A \leq_{m} B$ and $B$ is a regular language, does that imply that $A$ is a regular language? Why or why not? Theory of Computation michael-sipser theory-of-computation regular-language reduction proof + – admin asked Oct 19, 2019 admin 189 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.