NFA - A non deterministic finite automata base class
use FLAT::Legacy::FA::NFA;
This module implements a non deterministic finite automata, including support for epsilon transitions and conversion to a deterministic finite automata.
Brett D. Estrade - <estrabd AT mailcan DOT com>
Currently, all states are stored as labels. There is also no integrity checking for consistency among the start, final, and set of all states.
I haven't hit any yet :)
Perl FLaT Project Website at http://perl-flat.sourceforge.net/pmwiki
This suite of modules started off as a homework assignment for a compiler class I took for my MS in computer science at the University of Southern Mississippi. It then became the basis for my MS research. and thesis.
Mike Rosulek has joined the effort, and is heading up the rewrite of Perl FLaT, which will soon be released as FLaT 1.0.
This code is released under the same terms as Perl.
