3 3 votes Are Turing decidable languages are closed under Complementation, Reversal, Homomorphism, Inverse Homomorphism and Substitution? Theory of Computation theory-of-computation turing-machine decidability + – Utkarsh Anand 1.9k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Turing decidable languages also called Recursive lanuages, are closed under -Union -Intersection -Complement -Reversal -Kleene star -Concatenation -Homomorphism, -Inverse Homomorphism Raushank2 answered Aug 1, 2017 Raushank2 comment Share Follow See all 3 Comments 3 3 Comments reply Hemant Parihar commented Aug 1, 2017 reply Follow flag Not closed under homomorphism and substitution. http://gatecse.in/closure-property-of-language-families/ 2 2 replyShare amrendra pal commented Aug 20, 2017 i edited by amrendra pal Sep 10, 2017 reply Follow flag @Hemant , thanks for giving the link of closure properties of languages 0 0 replyShare suryaprakash commented Jun 2, 2018 reply Follow flag yes not closed under hmomorphism and subtitution 0 0 replyShare Please log in or register to add a comment.
