NAME

DFA - A determinisitic finite automata base class

SYNOPSIS

    use FLAT::Legacy::FA::DFA;

DESCRIPTION

This module is implements a deterministic finite automata, including the testing of strings accepted by the DFA.

AUTHOR

Brett D. Estrade - <estrabd AT mailcan DOT com>

CAVEATS

Currently, all states are stored as labels. There is also no integrity checking for consistency among the start, final, and set of all states.

BUGS

I haven't hit any yet, but every now and then minimize makes me pause, thoughthis might have more to do with my lack of intuition than the minimization being done incorrectly.

AVAILABILITY

Perl FLaT Project Website at http://perl-flat.sourceforge.net/pmwiki

ACKNOWLEDGEMENTS

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.

COPYRIGHT

This code is released under the same terms as Perl.