Automata

5. Show that the following problem is also decidable: Given a TM M, whether there exists a TM M’ such that M’ contains the same number of L-instructions and R-instructions, and L(M’) = L(M)? Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .