0 votes 0 votes Show that the collection of Turing-recognizable languages is closed under the operation of union. concatenation. star. intersection. homomorphism. Theory of Computation michael-sipser theory-of-computation turing-machine recursive-and-recursively-enumerable-languages + – admin asked Oct 15, 2019 admin 158 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.