0 votes 0 votes Theory of Computation recursive-and-recursively-enumerable-languages theory-of-computation ace-test-series decidability + – Shankar Kakde asked Jan 23, 2019 • edited Mar 3, 2019 by I_am_winner Shankar Kakde 401 views answer comment Share Follow See 1 comment See all 1 1 comment reply OneZero commented Jan 24, 2019 reply Follow Share L1 is not REL L2 may or maynot be REL https://gateoverflow.in/?qa=blob&qa_blobid=11495432775930404949 see slide 26 (6th and 7th point). 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes in L1) We are getting T yes and T no so...not recognizable while in L2) we r not getting T yes subset of T no,……...so it’s not non-monotonic property of rice’ theorem hence it’s turing recognizable so , ans is B MANSI_SOMANI answered Nov 28, 2022 MANSI_SOMANI comment Share Follow See all 0 reply Please log in or register to add a comment.