2 votes 2 votes Theory of Computation made-easy-test-series theory-of-computation recursive-and-recursively-enumerable-languages + – rajoramanoj asked Sep 28, 2017 • edited Mar 4, 2019 by adeebafatima1 rajoramanoj 411 views answer comment Share Follow See 1 comment See all 1 1 comment reply rajoramanoj commented Sep 29, 2017 i edited by rajoramanoj Oct 1, 2017 reply Follow Share @ Praveen Saini sir plz explain this..... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L is recursive.(b) Abhishek rai 1 answered Sep 30, 2017 Abhishek rai 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes its not recursive but REL as Tyes but Tno is not decidable as infinite sample set syed aamiruddin answered Oct 1, 2017 syed aamiruddin comment Share Follow See all 0 reply Please log in or register to add a comment.
