Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
automaton::properties::UndistinguishableStates Class Reference

#include <UndistinguishableStates.h>

Static Public Member Functions

template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > undistinguishable (const automaton::DFA< SymbolType, StateType > &dfa)
 
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > > undistinguishable (const automaton::DFTA< SymbolType, StateType > &fta)
 

Detailed Description

Partition undistinguishable states in automata

See also
DistinguishableStates

Member Function Documentation

◆ undistinguishable() [1/2]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::UndistinguishableStates::undistinguishable ( const automaton::DFA< SymbolType, StateType > &  dfa)
static

Creates state partitioning of undistinguishable states.

Template Parameters
SymbolTypeType for input symbols.
StateTypeType for states.
Parameters
dfaautomaton which states are to be partitioned
Returns
state partitioning of undistinguishable states
Here is the call graph for this function:
Here is the caller graph for this function:

◆ undistinguishable() [2/2]

template<class SymbolType , class StateType >
ext::set< ext::pair< StateType, StateType > > automaton::properties::UndistinguishableStates::undistinguishable ( const automaton::DFTA< SymbolType, StateType > &  fta)
static

Creates state partitioning of undistinguishable states-

Template Parameters
SymbolTypeType for input symbols.
RankTypeType of ranks of input symbols.
StateTypeType for states.
Parameters
dftaautomaton which states are to be partitioned
Returns
state partitioning of undistinguishable states
Here is the call graph for this function:

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