True False Questions Explanations D Decidable Language Sd Semi Decidable Q25689557

True or false questions with explanations.D is decidable language and Sd is semi decidable.
(11). Every infinite language has a subset that is not in D. (12). If-H were in D then every SD language would be in D. (13). (M:L(M is context free) is in D. (14). (M: L is not context free) is in D. (15). If Li is reducible to L2 and L2 e D then L1 E D.(11). Every infinite language has a subset that is not in D. (12). If-H were in D then every SD language would be in D. (13). (M:L(M is context free) is in D. (14). (M: L is not context free) is in D. (15). If Li is reducible to L2 and L2 e D then L1 E D. Show transcribed image text

0 replies

Leave a Reply

Want to join the discussion?
Feel free to contribute!

Leave a Reply

Your email address will not be published. Required fields are marked *