--- a/ninems/ninems.tex	Thu Jul 25 11:46:06 2019 +0100
+++ b/ninems/ninems.tex	Thu Jul 25 12:59:07 2019 +0100
@@ -1234,7 +1234,7 @@
 
 \begin{center}
 $\textit{retrieve} \; (r^\uparrow   \backslash  s) \; v = \;\textit{retrieve} \;
-\textit{simp}(r^\uparrow)  \backslash  s \; v'$
+(\textit{simp}(r^\uparrow)  \backslash  s) \; v'$
 \end{center}
 
 \noindent
@@ -1279,7 +1279,14 @@
 choose to not implement the classic automata approach of transforming
 regular expressions into NFAs and then DFAs---because we simply do not
 know how such back-references can be represented by DFAs.
-
+We also plan to implement the bitcoded algorithm
+in some imperative language like C to see if the inefficiency of the 
+Scala implementation
+is language specific. To make this research more comprehensive we also plan
+to contrast our (faster) version of bitcoded algorithm with the
+Symbolic Regex Matcher, the RE2, the Rust Regex Engine, and the static
+analysis approach by implementing them in the same language and then compare
+their performance.
 
 \bibliographystyle{plain}
 \bibliography{root}