Static Public Member Functions
template<class T > requires isDFA < T > \|\| isNFA < T >
static FA< T >	minimize (const T &nfa, const ext::set< ext::set< typename T::StateType > > &partitions)

template<class T > requires isDFTA < T > \|\| isNFTA < T >
static FTA< T >	minimize (const T &dfta, const ext::set< ext::set< typename T::StateType > > &partitions)

template<class T > requires isUnorderedDFTA < T > \|\| isUnorderedNFTA < T >
static UnorderedFTA< T >	minimize (const T &dfta, const ext::set< ext::set< typename T::StateType > > &partitions)

Detailed Description

Minimization of finite automata using distinguishable states method from Hopcroft 4.4.1 - 4.4.3 for finite automata

See also: automaton::simplify::Minimize; automaton::simplify::MinimizeBrzozowski

Member Function Documentation

template<class T >
requires isDFTA < T > || isNFTA < T >

static FTA< T > automaton::simplify::MinimizeByPartitioning::minimize	(	const T &	dfta,
		const ext::set< ext::set< typename T::StateType > > &	partitions
	)

static

Aggregates the given automaton with respect to a state partitioning.

Template Parameters

SymbolType	Type for input symbols.
StateType	Type for states.

Parameters

dfta	deterministic finite tree automaton to minimize.
partitions	state partitioning

template<class T >
requires isUnorderedDFTA < T > || isUnorderedNFTA < T >

static UnorderedFTA< T > automaton::simplify::MinimizeByPartitioning::minimize	(	const T &	dfta,
		const ext::set< ext::set< typename T::StateType > > &	partitions
	)

static

Aggregates the given automaton with respect to a state partitioning.

Template Parameters

SymbolType	Type for input symbols.
StateType	Type for states.

Parameters

dfta	deterministic unordered finite tree automaton to minimize.
partitions	state partitioning

Returns: Minimal deterministic unordered finite tree automaton equivalent to dfa

template<class T >
requires isDFA < T > || isNFA < T >

static FA< T > automaton::simplify::MinimizeByPartitioning::minimize	(	const T &	nfa,
		const ext::set< ext::set< typename T::StateType > > &	partitions
	)

static

Aggregates the given automaton with respect to a state partitioning.

Template Parameters

SymbolType	Type for input symbols.
StateType	Type for states.

Parameters

nfa	deterministic finite automaton to minimize.
partitions	state partitioning

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