Question

1. Introduce a Turing machine to decide the languages to follow. You must
algorithmic description, but with a sufficient level of detail.
You can use the variants of the original model of the Turing machine.

a) A = {0^k 1^i0^j| k = i × j}.

b) B = {w w^R w | where w is a word formed by 0's and 1's}

c) C = {w ∈ {a, b}∗| w is a palindrome and has the same number of a's and b's}.

Answer 1

Desscription

1. Go to the right most and turn right on a blank symbol
2. Turn one 0 as a blank symbol if it is not there go to step 4
3. Move left on all 0s
   i) Change 1 as x and move to the left most, turn right on a blank
   ii) Change 0 as a blank and move right till you encounter an x and turn left
   iii) repeat step i) if there is a 1, else go right and change all x's to 1s and go to step 1
4. Move left on all 1s and if a blank comes up, accept

Example run: 00000011100
00000011100
0000001110
0000011x0
00001xx0
000xxx0
0001110
000111
0011x
01xx
xxx
111
ACCEPT

--------------------------------------
Multiple questions are posted. Answered one. Please post one at a time. Policy of Chegg.