NAME

PFA - A parallel finite automata base class

SYNOPSIS

use FLAT::Legacy::FA::PFA;

DESCRIPTION

This module is implements a paralle finite automata, and the conversion of such to a non deterministic finite automata;

One key between PFA implementation an PFA & DFA is that the PFA may contain more than one start node since it may depict threads of concurrent execution. The main purpose of this module is to convert a PFA to an PFA.

AUTHOR

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

CAVEATS

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

BUGS

I haven't hit any yet :)

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.