Update readme with latest changes

1 files changed, 2 insertions, 3 deletions

diff --git a/Readme.md b/Readme.md
index 0eca67d..256e669 100644
--- a/Readme.md
+++ b/Readme.md
@@ -53,7 +53,7 @@ A Turing machine state consists of a Turing machine definition, but also include
                                 running :: TuringMachineTermination }
     :: TuringMachineTermination = Running | Normal | Abnormal
 
-Here, `a` is the tape alphabet and `i` is the input alphabet. We will come back to that.
+Here, `a` is the tape alphabet. We will come back to that.
 
 As you can see, we specify states simply with integers. Mathematically, a Turing machine is a quintuple (Q,&Sigma;,&Gamma;,&delta;,q<sub>0</sub>) where Q is the set of states and q<sub>0</sub> the initial state (Sudkamp, Languages and Machines, 1997). Here, we take the integers as Q and 0 as q<sub>0</sub>. `a` relates to &Gamma;, `i` relates to &Sigma; and we will get back to &delta;.
 
@@ -117,8 +117,7 @@ From this state we can either `step`...
 
 The `TuringMachineState` instantiates `toString`. The result of `toString statef` would be:
 
-    Normally terminated turing machine in state 2, tape head at 0.
-    Tape: BbbaabbB
+    [q2]BbbaabbB (Normally terminated)
 
 As you can see, the machine definition is in no way represented by this function.