FLAT::FA - Base class for regular finite automata
A FLAT::FA object is a collection of states and transitions. Each state may be labeled as starting or accepting. Each transition between states is labeled with a transition object.
FLAT::FA is a superclass that is not intended to be used directly. However, it does provide the following methods:
Returns a list of all the state "names" in $fa.
Returns the number of states in $fa.
Returns a boolean indicating whether $state_id is a recognized state "name."
Deletes the states given in @states and their corresponding transitions. The remaining states in the FA may be "renamed" (renumbered)! Return value not used.
Adds $num states to $fa, and returns a list of the new state "names."
Returns a list of all the states which are labeled as starting/accepting, respectively.
Sets/unsets a list of states as being labeled starting/accepting, respectively.
Returns a boolean indicating whether $state is labeled as starting/accepting, respectively.
Deletes the states which are not reachable (via zero or more transitions) from starting states. Returns a list of the "names" of states that were deleted.
Each transition between states is a transition object, which knows how to organize several "labels." Think of this as the mechanism by which multiple arrows in the state diagram between the same states are collapsed to a single arrow. This interface is abstracted away into the following public methods:
Resets the transition between $state1 and $state2 to a transition initialized using data @labels.
If @labels is omitted or contains only undefined elements,
then the call is equivalent to
Adds @labels to the transition between $state1 and $state2.
Returns the transition object stored between $state1 and $state2, or undef if there is no transition.
Removes the transition object between $state1 and $state2.
Given a state/set of states, and one or more labels, returns a list of the states (without duplicates) reachable from the states via a single transition having any of the given labels. If no labels are given, returns the states reachable by any (single) transition.
Note that this method makes no distinction for epsilon transitions, these are only special in FLAT::NFA objects.
Returns the list of characters (without duplicates) used among all transition labels in the automaton.
Returns a string containing a GraphViz (dot) description of the automaton, suitable for rendering with your favorite GraphViz layout engine.
Returns a string containing a plaintext description of the automaton, suitable for debugging purposes.
Returns an identical copy of $fa.
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
This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.