Skip to content

Commit 6a8554f

Browse files
authored
Edit the Turing instructions for palindrome
So that the choice to enter RIGHT_0 or RIGHT_1 is unambiguous by replacing them with RIGHT_b
1 parent 262eded commit 6a8554f

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

lec_06_loops.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -146,7 +146,7 @@ We describe the operation of our Turing machine $M$ in words:
146146

147147
* $M$ starts in state `START` and goes right, looking for the first symbol that is $0$ or $1$. If it finds $\varnothing$ before it hits such a symbol then it moves to the `OUTPUT_1` state described below.
148148

149-
* Once $M$ finds such a symbol $b \in \{0,1\}$, $M$ deletes $b$ from the tape by writing the $\times$ symbol, it enters either the `RIGHT_0` or `RIGHT_1` mode according to the value of $b$ and starts moving rightwards until it hits the first $\varnothing$ or $\times$ symbol.
149+
* Once $M$ finds such a symbol $b \in \{0,1\}$, $M$ deletes $b$ from the tape by writing the $\times$ symbol, it enters either the `RIGHT_`$b$ mode and starts moving rightwards until it hits the first $\varnothing$ or $\times$ symbol.
150150

151151
* Once $M$ finds this symbol, it goes into the state `LOOK_FOR_0` or `LOOK_FOR_1` depending on whether it was in the state `RIGHT_0` or `RIGHT_1` and makes one left move.
152152

0 commit comments

Comments
 (0)