0 votes 0 votes R = RE ∩ Co-RE where R is the set of recursive language,RE is the set of languages of which membership can be proved in finite time and Co-RE is the set of language of which membership can be disproved in finite amount of time -True/False? Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages + – Prajwal Bhat asked Jan 6, 2017 • retagged Jul 4, 2017 by Arjun Prajwal Bhat 243 views answer comment Share Follow See 1 comment See all 1 1 comment reply Kaushik.P.E commented Jan 6, 2017 reply Follow Share True? If it possible to decide if the input belongs to the language in finite time it is a recursive language. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes TRUE. All languages that satisfy the intersection condition mentioned have algorithms to prove/disprove membership of input strings in finite time. So it must be Recursive Language. Kaushik.P.E answered Jan 6, 2017 Kaushik.P.E comment Share Follow See all 0 reply Please log in or register to add a comment.
