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

#include <RandomDFAGenerator.hpp>

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

regal::AbstractRandomGenerator< Automaton_t > regal::AbstractDFAGenerator< StateLabel_t, Sigma, Automaton_t > regal::RandomCompleteICDFAGenerator< StateLabel_t, Sigma, Automaton_t > regal::RandomIncompleteICDFAGenerator< StateLabel_t, Sigma, Automaton_t > List of all members.

Public Member Functions

int * getRejectCounters ()
Automaton_t * random ()
Automaton_t * randomCoAccessible ()
 RandomDFAGenerator (const int &autSize, const Alphabet< Sigma > &alpha, const double &prob=0.5, const bool &c=false)
Automaton_t * randomLocal ()
Automaton_t * randomMinimal ()
Automaton_t * randomOneFinalState ()
Automaton_t * randomStronglyConnected ()
 ~RandomDFAGenerator ()

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


Constructor & Destructor Documentation

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
regal::RandomDFAGenerator< StateLabel_t, Sigma, Automaton_t >::RandomDFAGenerator ( const int &  autSize,
const Alphabet< Sigma > &  alpha,
const double &  prob = 0.5,
const bool &  c = false 
) [inline]

Create a random DFA Generator

Parameters:
autSize is the number of states in the generated automatons
alphaSize is the size of the alphabet in the generated automatons
prob is the probability for a state to be final

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

Destroy the RandomDFAGenerator


Member Function Documentation

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
int* regal::RandomDFAGenerator< StateLabel_t, Sigma, Automaton_t >::getRejectCounters (  )  [inline]

Returns the number of reject used to generate the previous Automaton

Returns:
the number of Bolztmann rejects and Dyck rejects.

template<typename StateLabel_t, typename Sigma, class Automaton_t = AbstractAutomaton<StateLabel_t,Sigma>>
Automaton_t* regal::RandomDFAGenerator< StateLabel_t, Sigma, Automaton_t >::random (  )  [inline, virtual]

Returns a randomly generated automaton

Returns:
a randomly generated automaton

Implements regal::AbstractRandomGenerator< Automaton_t >.

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

Returns a randomly generated strongly connected automaton

Returns:
a randomly generated strongly connected automaton

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

Returns a randomly generated local automaton

Returns:
a randomly generated local automaton

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

Returns a randomly generated minimal automaton

Returns:
a randomly generated minimal automaton

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

Returns a randomly generated automaton with only one final state

Returns:
a randomly generated automaton with only one final state

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

Returns a randomly generated strongly connected automaton

Returns:
a randomly generated strongly connected automaton


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