NAME

FLAT::DFA::Minimal - Deterministic finite automata

SYNOPSIS

A FLAT::DFA::Minimal object is a finite automata whose transitions are labeled with single characters. Furthermore, each state has exactly one outgoing transition for each available label/character. Additionally, it is meant to be created by first creating a FLAT::DFA, then running the as_min_dfa method.

USAGE

In addition to implementing the interface specified in FLAT and FLAT::NFA, FLAT::DFA objects provide DFA-specific methods. In addition, it provides the following methods meant for use with a minimal DFA.

$dfa->get_equivalence_classes

This method provides the set of states from the original DFA that are considered equivalent; this is returned as an ordered array ref of array refs.

$dfa->set_equivalence_classes

Setter for the equivalence classes member. Meant to be used internally when constructing and finally returning the FLAT::DFA:Minimal obect.

AUTHORS & ACKNOWLEDGEMENTS

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

The initial version (FLAT::Legacy) by B. Estarde 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.