- Please I Want To Prove That A And B Are Recursively Separable I Want The Answer Step By Step And Hurry Up Please I Don 1 (41.71 KiB) Viewed 27 times
Please, I want to prove that A and B are recursively separable. I want the answer step by step and hurry up please I don
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Please, I want to prove that A and B are recursively separable. I want the answer step by step and hurry up please I don
Please, I want to prove that A and B are recursively separable.I want the answer step by step and hurry up please I don't havetime
Let A and B be disjoint languages, that is, A n B = Ø. We say that the language C separates the languages A and B if A CC and B CC(Complement). We say that A and B are recursively separable if there is a decidable language C that separates A and B. Suppose that A(Complement) and B(Complement) are recognizable. Prove that A and B are recursively separable.
Let A and B be disjoint languages, that is, A n B = Ø. We say that the language C separates the languages A and B if A CC and B CC(Complement). We say that A and B are recursively separable if there is a decidable language C that separates A and B. Suppose that A(Complement) and B(Complement) are recognizable. Prove that A and B are recursively separable.