Static Public Member Functions
template<class SymbolType >
static automaton::NFTA< SymbolType, unsigned >	generateNFTA (size_t statesCount, const ext::set< common::ranked_symbol< SymbolType > > &alphabet, double density)

static automaton::NFTA< std::string, unsigned >	generateNFTA (size_t statesCount, size_t alphabetSize, size_t maxRank, bool randomizedAlphabet, double density)

Detailed Description

Generator of random automata.

The underlying generation algorithm is from Leslie, T: Efficient Approaches to Subset Construction, 1995.

Member Function Documentation

template<class SymbolType >

automaton::NFTA< SymbolType, unsigned > automaton::generate::RandomTreeAutomatonFactory::generateNFTA	(	size_t	statesCount,
		const ext::set< common::ranked_symbol< SymbolType > > &	alphabet,
		double	density
	)

static

Generates a random finite automaton.

Template Parameters

SymbolType the type of terminal symbols of the random automaton

Parameters

statesCount	number of states in the generated automaton
alphabet	Input alphabet of the automaton
density	density of the transition function

automaton::NFTA< std::string, unsigned > automaton::generate::RandomTreeAutomatonFactory::generateNFTA	(	size_t	statesCount,
		size_t	alphabetSize,
		size_t	maxRank,
		bool	randomizedAlphabet,
		double	density
	)

static

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Generates a random finite automaton.

Parameters

statesCount	number of states in the generated automaton
alphabetSize	size of the alphabet (1-26)
maxRank	the maximum rank in the randomly generated alphabet
randomizedAlphabet	selects random symbols from a-z range if true
density	density of the transition function (0-100). 100 means every possible transition is created

Here is the call graph for this function:

The documentation for this class was generated from the following files: