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

#include <ReachableStates.h>

Static Public Member Functions

template<class T >
static ext::set< typename T::StateType > reachableStates (const T &fsm)
 
template<class SymbolType , class StateType >
static ext::set< StateType > reachableStates (const automaton::MultiInitialStateNFA< SymbolType, StateType > &fsm)
 

Member Function Documentation

◆ reachableStates() [1/2]

template<class SymbolType , class StateType >
ext::set< StateType > automaton::properties::efficient::ReachableStates::reachableStates ( const automaton::MultiInitialStateNFA< SymbolType, StateType > &  fsm)
static
Here is the call graph for this function:

◆ reachableStates() [2/2]

template<class T >
ext::set< typename T::StateType > automaton::properties::efficient::ReachableStates::reachableStates ( const T &  fsm)
static

Removes dead states from FSM. Melichar 2.29

Here is the call graph for this function:
Here is the caller graph for this function:

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