Finit Automata Library writen in F#

Question

Could you recommend an open source library written in F# which provides generic types for FA construction and basic algorithms (NFA to DFA transformation, FA minimization ...)?

Answer 1

Probably not what you are looking for but a quick and dirty way to get some FA things working would be to write an equivalent context free grammar for your FA then using fsyacc?

Answer 2

My first thought would be to use the state machine monad, which has be blogged/written/discussed/produced several times, a couple of references are below.

http://fsharpcode.blogspot.com/2008/12/f-state-monad-type-state-state-state-of.html
http://codebetter.com/blogs/matthew.podwysocki/archive/2009/12/30/much-ado-about-monads-state-edition.aspx

although this doesn't give you the translations you want... Might be a place to start.