--- a/Journal/document/root.tex	Tue Sep 06 02:52:26 2011 +0000
+++ b/Journal/document/root.tex	Wed Sep 07 09:28:13 2011 +0000
@@ -58,7 +58,8 @@
 expressions can be defined conveniently as a datatype and a corresponding
 reasoning infrastructure comes for free. We show in this paper that a central
 result from formal language theory---the Myhill-Nerode theorem---can be
-recreated using only regular expressions.
+recreated using only regular expressions. From this theorem many closure
+properties of regular languages follow.
 \end{abstract}
 \maketitle