diff -r c334f0b3ef52 -r cc54ce075db5 ChengsongTanPhdThesis/Chapters/Further.tex
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/ChengsongTanPhdThesis/Chapters/Further.tex	Fri Jun 03 16:45:30 2022 +0100
@@ -0,0 +1,19 @@
+% Chapter Template
+
+\chapter{Further Improvements} % Main chapter title
+
+\label{Further} %In Chapter 5\ref{Chapter5} we discuss stronger simplifications to improve the finite bound
+%in Chapter 4 to a polynomial one, and demonstrate how one can extend the
+%algorithm to include constructs such as bounded repetitions and negations.
+ 
+%----------------------------------------------------------------------------------------
+%	SECTION strongsimp
+%----------------------------------------------------------------------------------------
+\section{Zippers}
+%TODO: search for isabelle proofs of algorithms that check equivalence 
+
+Unfortunately using zippers causes a similar effect like the "break up" rule
+and does not preserve the $\POSIX$ property.
+
+
+