· Write a TM (computable function) that does the following: Input: Two binary string of equal length separated by # (example: 0110#1010) Output: The result from performing logical AND on the two binary strings (0010) You may write the output on Tape 2.

Is there a pumping lemma for Turing machines? if so, what is it? if not, whynot?

Create a Turing machine for the following language: On Σ = {0,1} Language 1 (L1) every string in the language begin and end with 1 Language 2 (L2) all strings in the language begin with 001. The union of L1 and L2

Design Turing Machines using JFLAP to compute the fol- lowing function where x is an integer represented in unary. The value f(x) represented in unary should be on the tape surrounded by blanks after the calculation. Also show some test cases. f(x) = x (mod5)