<br><br><div class="gmail_quote">On Tue, Dec 28, 2010 at 3:09 AM, <span dir="ltr"><<a href="mailto:oleg@okmij.org">oleg@okmij.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="im"><br>
Maxime Henrion wrote:<br>
> I've been playing with some code to work with DFAs, but I'm now faced<br>
> with an implementation problem. In order to have states that can<br>
> transition to themselves, it seems I would need self-referential data;<br>
> otherwise I would need to separate those transitions from the rest and<br>
> handle them specially in the code.<br>
<br>
</div>Perhaps an old article<br>
<a href="http://okmij.org/ftp/misc.html#ccard-transform" target="_blank">http://okmij.org/ftp/misc.html#ccard-transform</a><br>
<br>
might be of some help. The article describes not only running a finite<br>
automaton (represented as a cyclic graph) on given input but also<br>
printing the automaton out and determinizing it: converting NFA to an<br>
equivalent DFA. The latter operation converts one cyclic graph to<br>
another.<br></blockquote><div><br></div><div>That link was a 404 for me. I think you meant this link:</div><div><a href="http://okmij.org/ftp/Haskell/misc.html#ccard-transform">http://okmij.org/ftp/Haskell/misc.html#ccard-transform</a></div>
<div><br></div><div>Thanks!</div><div>Jason</div></div>