Machine of Turing that inverts one binary sequence

State begins them: the testina of reading and writing is posizionata on the left of the more meaningful bit

State finale : the testina of reading and writing is posizionata on blank that precedeil the more meaningful bit

Description algorithm:

to) one is carried out specchiatura of the n° binary with spin axis around to the more meaningful bit and copied substitution of the bit with as many *.

b) the figure is replaced that precedes the 1° * with an other * and it is gone to transcribe in place of the last one *

c) is returned to the 1° *, if it is a n° is returned to the step b while if it is a blank they cancel all * to right sin when does not catch up a bit and it is finished.

Matrix works them

	b	0	1	*	description
qo		* q2 sx	* q1 sx		state begins them
q1	1 q3 dx	0 q1 sx	1 q1 sx		I replace with 1 1° blank that the encounter going on the left
q2	0 q3 dx	0 q2 sx	1 q2 sx		I replace with 0 1° blank that the encounter going on the left
q3		0 q3 dx	1 q3 dx	* q4 dx	I try the first one * to right
q4	b q5 dx	* q2 sx	* q1 sx	* q4 dx	I try the last one * to right
q5	b q10dx	* q8 dx	* q6 dx	* q5 sx	I replace with * the 1ª number on the left of * if it is a blank then exits from the cycle
q6	b q7 sx	0 q7 sx	1 q7 sx	* q6 dx	I try the last one * to right in order to replace it with 1
q7				1 q5 sx	I replace with 1 the last one * to right
q8	b q9 sx	0 q9 sx	1 q9 sx	* q8 dx	I try the last one * to right in order to replace it with 0
q9				0 q5 sx	I replace with 0 the last one * to right
q10		0 q11 sx	1 q11 sx	b q10dx	I replace all * with blank
q11					Aim

Example of computazione of tightens

q10

q11