191 <B>Myhill-Nerode and Regular Expressions</B> |
191 <B>Myhill-Nerode and Regular Expressions</B> |
192 Out of frustration of having to teach reasoning in theorem provers with worn-out examples like |
192 Out of frustration of having to teach reasoning in theorem provers with worn-out examples like |
193 fib and even/odd, we implemented a large part of regular language theory in Isabelle/HOL. |
193 fib and even/odd, we implemented a large part of regular language theory in Isabelle/HOL. |
194 This <A HREF="http://afp.sourceforge.net/devel-entries/Myhill-Nerode.shtml">implementation</A> |
194 This <A HREF="http://afp.sourceforge.net/devel-entries/Myhill-Nerode.shtml">implementation</A> |
195 gives rise to much more interesting examples, as shown |
195 gives rise to much more interesting examples, as shown |
196 <A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.ps">here</A> and |
196 <A HREF="http://www.cs.cmu.edu/~rwh/papers/regexp/jfp.pdf">here</A> and |
197 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
197 <A HREF="http://ropas.snu.ac.kr/~kwang/paper/06-jfp-yi.pdf">here</A>. It turns out that |
198 formalisations of automata theory are a huge |
198 formalisations of automata theory are a huge |
199 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
199 <A HREF="https://lists.cam.ac.uk/pipermail/cl-isabelle-users/2005-September/msg00012.html">pain</A> |
200 in theorem provers, especially in those that are based on HOL. |
200 in theorem provers, especially in those that are based on HOL. |
201 We therefore went against the |
201 We therefore went against the |