228 Then we improve the algorithm with a stronger version of 

   228 Then we improve the algorithm with a stronger version of 

   229 simplification, and prove a time bound linear to input and

   229 simplification, and prove a time bound linear to input and

   230 cubic to regular expression size using a technique introduced by

   230 cubic to regular expression size using a technique introduced by

   231 Antimirov.

   231 Antimirov.

   232 The result is an algorithm with provable guarantees on 

   232 The result is an algorithm with provable guarantees on 

   234 work with these two guarantees together.

   234 work with these two guarantees together.

   235 

   235 

   236 \end{abstract}

   236 \end{abstract}

   237 

   237 

   238 

   238