1 votes 1 votes Show that if $L$ is regular, so is $L$ $∪$ {$a$}, for all $a∈Σ$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata regular-language + – Naveen Kumar 3 asked Mar 20, 2019 Naveen Kumar 3 415 views answer comment Share Follow See 1 comment See all 1 1 comment reply Verma Ashish commented Mar 20, 2019 reply Follow Share Regular languages are closed under union. There are many ways to prove.. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes regular lang are closed under union . abhishekmehta4u answered Mar 20, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
