--- a/progs/thompson.scala	Tue Oct 17 13:49:45 2017 +0100
+++ b/progs/thompson.scala	Wed Oct 18 08:36:44 2017 +0100
@@ -164,9 +164,9 @@
 
 // while my thompson-enfa-subset-partial-function-chain
 // is probably not the most effcient way to obtain a fast DFA 
-// (the below should be much faster with a more direct construction),
-// in general the DFAs can be slow because of the state explosion
-// in the subset construction
+// (the test below should be much faster with a more direct 
+// construction), in general the DFAs can be slow because of 
+// the state explosion in the subset construction
 
 for (i <- 1 to 13) {
   println(i + ": " + "%.5f".format(time_needed(2, tmatches_dfa(EVIL1(i), "a" * i))))