Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <DistinguishableStates.h>
Static Public Member Functions | |
template<class SymbolType , class StateType > | |
static ext::set< ext::pair< StateType, StateType > > | distinguishable (const automaton::DFA< SymbolType, StateType > &fsm) |
template<class SymbolType , class StateType > | |
static ext::set< ext::pair< StateType, StateType > > | distinguishable (const automaton::DFTA< SymbolType, StateType > &fta) |
template<class SymbolType , class StateType > | |
static ext::set< ext::pair< StateType, StateType > > | distinguishable (const automaton::UnorderedDFTA< SymbolType, StateType > &fta) |
Find all distinguishable pairs of states of DFA. Implements table-filling algorithm, Hopcroft 2nd edition, 4.4.1
|
static |
Find all distinguishable pairs of states of DFA. Implements table-filling algorithm, Hopcroft 2nd edition, 4.4.1 O(n^4) version. TODO quadratic-time version.
fsm | automaton |
fsm
|
static |
|
static |