Design a TM to recognize each of the following languages. {ww R | w € (0+1) * } Design a Turing Machine M that decides A={0k /n>0 and k=2n } the language consisting of all strings of 0’s whose length...

Design a TM to recognize each of the following languages. {ww R | w € (0+1) * }

Design a Turing Machine M that decides A={0k /n>0 and k=2n } the language consisting of all strings of 0’s whose length is a power of 2.

Demonstrate the working of your TM with an example.

Show that the language{0n 1n 2n /n>=1}is not context free.

Show that the context free languages are closed under union operation but not under intersection.

Design a TM with no more than three states that accepts the language. a(a+b) * .Assume €={a,b}

Design a TM to implement the function f(x)= x+1.

Design a TM to accept the set of all strings {0,1} with 010 as substring.

Design a TM to accept the language LE={a n b n c n |n > 1 }.