Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Go to the source code of this file.
Namespaces | |
namespace | automaton |
namespace | automaton::determinize |
Functions | |
template<class SymbolType , class StateType > | |
void | automaton::determinize::constructTransitions (const common::ranked_symbol< SymbolType > &symbol, typename ext::vector< StateType >::const_iterator state, typename ext::vector< StateType >::const_iterator end, const StateType &rhs, const ext::multimap< StateType, ext::set< StateType > > &nftaStateToDftaStates, ext::vector< ext::set< StateType > > &transitionLHS, ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::vector< ext::set< StateType > > >, ext::set< StateType > > &resultTransition) |
template<class SymbolType , class StateType > | |
void | automaton::determinize::constructTransitions (const common::ranked_symbol< SymbolType > &symbol, typename ext::multiset< StateType >::const_iterator state, typename ext::multiset< StateType >::const_iterator end, const StateType &rhs, const ext::multimap< StateType, ext::set< StateType > > &nftaStateToDftaStates, ext::multiset< ext::set< StateType > > &transitionLHS, ext::map< ext::pair< common::ranked_symbol< SymbolType >, ext::multiset< ext::set< StateType > > >, ext::set< StateType > > &resultTransition) |