0 votes 0 votes Let $L$ be a context-free language. Show that then $L^+$ is recusively enumerable. Suggest an enumeration procedure for it. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 16, 2019 Rishi yadav 131 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.