--- a/ChengsongTanPhdThesis/Chapters/Chapter2.tex	Fri May 27 22:37:08 2022 +0100
+++ b/ChengsongTanPhdThesis/Chapters/Chapter2.tex	Sat May 28 01:04:56 2022 +0100
@@ -904,7 +904,7 @@
 which we will use later.
 \begin{center}
 \begin{tabular}{ccc}
-$\retrieve \; \ACHAR \, \textit{bs} \, c \; \Char(c) = \textit{bs}
+$\retrieve \; \ACHAR \, \textit{bs} \, c \; \Char(c) = \textit{bs}$
 \end{tabular}
 \end{center}
 
@@ -912,7 +912,7 @@
 %----------------------------------------------------------------------------------------
 %	SECTION  correctness proof
 %----------------------------------------------------------------------------------------
-\section{Correctness of Bit-coded Algorithm (Without Simplification)
+\section{Correctness of Bit-coded Algorithm (Without Simplification)}
 We now give the proof the correctness of the algorithm with bit-codes.
 
 Ausaf and Urban cleverly defined an auxiliary function called $\flex$,