Turing Decidable Languages

Question

Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution?

Answer 1

Turing decidable languages also called Recursive lanuages, are closed under

-Union

-Intersection

-Complement

-Reversal

-Kleene star

-Concatenation

-Homomorphism,

-Inverse Homomorphism 

Comments

Not closed under homomorphism and substitution.
http://gatecse.in/closure-property-of-language-families/

---

@Hemant , thanks for giving the link of closure properties of languages

---

yes not closed  under hmomorphism and subtitution