Blog

Given a language $ L$ over the alphabet $ \{0,1\}$ . Let $ L^*= \{ w_1w_2…w_n | n \ge 0, w_1,…,w_n \in L\}$ . Prove: If $ L$ is recursive, then $ L^*$ is recursive as well. If $ L^*$ is recursive, then $ L$ is recursive as well. For the first proof I haveRead more