|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::DFA< SymbolType, StateType > &fta) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::NFA< SymbolType, StateType > &fta) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &afdza) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > &afnza) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::DFTA< SymbolType, StateType > &fta) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::NFTA< SymbolType, StateType > &fta) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::UnorderedDFTA< SymbolType, StateType > &fta) |
|
template<class SymbolType , class StateType > |
static ext::set< ext::pair< StateType, StateType > > | backwardBisimulation (const automaton::UnorderedNFTA< SymbolType, StateType > &fta) |
|
Find all backwardBisimulation pairs of states of DFA. Implements table-filling algorithm, Hopcroft 2nd edition, 4.4.1