1 votes 1 votes Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages + – Hirak asked Jun 2, 2019 Hirak 371 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes D) L is REL TM is not able to accept all the languages there are some languages which TM cannot accept and REL is not closed under complementation Ravijha answered Jun 20, 2019 Ravijha comment Share Follow See all 0 reply Please log in or register to add a comment.