regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t > Class Template Reference

#include <MinimizingAlgorithm.hpp>

Inheritance diagram for regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >:

regal::MooreAlgorithm< StateLabel_t, Sigma, Automaton_t > regal::MyMooreAlgorithm< StateLabel_t, Sigma, Automaton_t > List of all members.

Public Member Functions

virtual unsigned int * minimizeMultipleComplexity (Automaton_t *a)=0
virtual int * minimizeToPartition (Automaton_t *a, const int &it=-1)=0
 MinimizingAlgorithm ()
virtual ~MinimizingAlgorithm ()

Protected Attributes

int maxClass
int * partitionRes
int size

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
class regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >


Constructor & Destructor Documentation

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::MinimizingAlgorithm (  )  [inline]

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
virtual regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::~MinimizingAlgorithm (  )  [inline, virtual]


Member Function Documentation

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
virtual unsigned int* regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::minimizeMultipleComplexity ( Automaton_t *  a  )  [pure virtual]

Implemented in regal::MooreAlgorithm< StateLabel_t, Sigma, Automaton_t >, and regal::MyMooreAlgorithm< StateLabel_t, Sigma, Automaton_t >.

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
virtual int* regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::minimizeToPartition ( Automaton_t *  a,
const int &  it = -1 
) [pure virtual]

Minimize an automaton and returns a partition of the states.

Parameters:
a is the automaton to minimize
Returns:
partition of the states in the minimized automaton

Implemented in regal::MooreAlgorithm< StateLabel_t, Sigma, Automaton_t >, and regal::MyMooreAlgorithm< StateLabel_t, Sigma, Automaton_t >.


Member Data Documentation

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
int regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::maxClass [protected]

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
int* regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::partitionRes [protected]

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
int regal::MinimizingAlgorithm< StateLabel_t, Sigma, Automaton_t >::size [protected]


The documentation for this class was generated from the following file:
Generated on Mon Sep 29 16:33:59 2008 for REGAL by  doxygen 1.5.1