Let S_n = { + M is a TM and |L(M)| = n} for n = 0, 1, 2, 3, … a. Show that for every n greaterthanorequalto 0, S_n reduces to S_n+1. b. Show that for every n greaterthanorequalto 1, S_n+1 reduces to S_n.
Expert Answer
S0 = { <M>, | L(M) | = 0 }, n=0 Empty language
S1= { <M>, |L(M) | = 1} , for n=1, {0}
S2= { <M>, |L(M) | = 2 } , for n=2, { 0,1 }
By definition of Turing reductions, n>=0, S0 is reducible to S1 .
For,, n>=1, S2 is reducible to S1