1 % Chapter Template

     2 

     3 \chapter{Further Improvements} % Main chapter title

     4 

     5 \label{Further} %In Chapter 5\ref{Chapter5} we discuss stronger simplifications to improve the finite bound

     6 %in Chapter 4 to a polynomial one, and demonstrate how one can extend the

     7 %algorithm to include constructs such as bounded repetitions and negations.

     8  

     9 %----------------------------------------------------------------------------------------

    10 %	SECTION strongsimp

    11 %----------------------------------------------------------------------------------------

    12 \section{Zippers}

    13 %TODO: search for isabelle proofs of algorithms that check equivalence 

    14 

    15 Unfortunately using zippers causes a similar effect like the "break up" rule

    16 and does not preserve the $\POSIX$ property.

    17 

    18 

    19