--- a/Spiral.scala	Wed Feb 05 12:41:30 2020 +0000
+++ b/Spiral.scala	Wed Feb 05 14:50:57 2020 +0000
@@ -562,7 +562,7 @@
     val r = ("ab" | (  (("a")%) | "aa")  )
     //val r = ("a"|"b")~("a")
     val s = "aa"
-    for(i <- 0 to s.length-1){
+    for(i <- 1 to s.length-1){
       val ss = s.slice(0, i+1)
       val nangao = bders_simp_rf(ss.toList, internalise(r))
       val easy = (bders(ss.toList, internalise(r)))

--- a/etnms/etnms.tex	Wed Feb 05 12:41:30 2020 +0000
+++ b/etnms/etnms.tex	Wed Feb 05 14:50:57 2020 +0000
@@ -1202,7 +1202,8 @@
 is opened up to make the list consisting of two separate elements 
 $_{00}\ONE$ and $_{011}a^*$, note that $flatten$ 
 $\fuse$s the bit(s) $_0$ to the front of $_0\ONE $ and $_{11}a^*$.
-In a nutshell, the order of simplification causes
+The order of simplification, which impacts the order that alternatives
+are  opened up, causes
 the bits to be moved differently.
  
  \subsubsection{A Failed Attempt To Remedy the Problem Above}
@@ -1372,9 +1373,15 @@
 $r$ is the regular expression
 $(ab+(a^*+aa))$ and $s$  is the string $aa$
 \end{center}
-$\rup\backslash_{simp} \, s \neq \simp(\rup\backslash s)$
-happens again, whereas this does not happen for the old
+
+\noindent
+$\rup\backslash_{simp} \, s$ is equal to 
+$ _0(_0\ONE  + _{11}a^*)$
+$\rup\backslash_{simp} \, s \neq \simp(\rup\backslash s)$,
+ whereas this does not happen for the old
 version of $\simp$.
+We have changed the algorithm to suppress the old
+counterexample, but this gives rise to new counterexamples.
 This dilemma causes this amendment not a successful 
 attempt to make $\rup\backslash_{simp} \, s = \simp(\rup\backslash s)$
 under every possible regular expression and string.