equal
deleted
inserted
replaced
212 |
212 |
213 We define rewriting relations for $\rrexp$s, which allows us to do the |
213 We define rewriting relations for $\rrexp$s, which allows us to do the |
214 same trick as we did for the correctness proof, |
214 same trick as we did for the correctness proof, |
215 but this time we will have stronger equalities established. |
215 but this time we will have stronger equalities established. |
216 \subsection{"hrewrite" relation} |
216 \subsection{"hrewrite" relation} |
217 List of simplifications for regular expressions simplification without bitcodes: |
217 List of 1-step rewrite rules for regular expressions simplification without bitcodes: |
218 \ |
218 \ |
219 |
219 |
220 |
220 |
221 |
221 |
222 |
222 |