NAME

FLAT::XFA - X Finite Automata

SYNOPSIS

An XFA is a FA (implemented as a DFA here) that allows for RE's as transition symbols; this will be used, for among other things, the implementation of the conversion, DFA to RE, using state elimination.

USAGE

none; not yet implemented.

AUTHORS & ACKNOWLEDGEMENTS

FLAT is written by Mike Rosulek <mike at mikero dot com> and Brett Estrade <estradb at gmail dot com>.

The initial version (FLAT::Legacy) by Brett Estrade was work towards an MS thesis at the University of Southern Mississippi.

Please visit the Wiki at http://www.0x743.com/flat

LICENSE

This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.