Algorithms for Making Finite State Machines

Appeared in Volume 9/1, February 1996

wfc@cl.cam.ac.uk
W F Clocksin
30th October 1995

Does anybody have a good way (i.e. idiomatic to Prolog) of finding the minimal finite-state machine which is equivalent to a given regular expression?

jkm@mitre.org
Jon Millen
2nd November 1995

The following site contains algorithms for finite state machines in Prolog:
http://www.let.rug.nl/~vannoord/fsa

The package is implemented in SICStus Prolog, but the author states that it shouldn't be too difficult to adapt it to other Prologs.