% 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" ruleand does not preserve the $\POSIX$ property.