Parts 9

Problem 9: Tuing Machines Show that the following languages with 2 = { 0, 1 I decidable by building a TM that decides + : L = { w l w Contatos twice as many 0's as 1's }