automaton::properties::ReachableStates Class Reference

#include <ReachableStates.h>

Static Public Member Functions
template<class T > requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isCompactNFA < T > || isExtendedNFA < T >
static ext::set< typename T::StateType >	reachableStates (const T &fsm)
template<class T > requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >
static ext::set< typename T::StateType >	reachableStates (const T &fsm)
template<class T > requires isDFTA < T > || isNFTA < T >
static ext::set< typename T::StateType >	reachableStates (const T &fta)
template<class T > requires isAFDZA < T > || isAFNZA < T >
static ext::set< typename T::StateType >	reachableStates (const T &afza)

Detailed Description

Find all reachable states of an automaton A state is reachable if there exists any sequence of transitions from the initial state to it.

Member Function Documentation

reachableStates() [1/4]

template<class T >
requires isAFDZA < T > || isAFNZA < T >

static ext::set< typename T::StateType > automaton::properties::ReachableStates::reachableStates ( const T &  afza )

static

reachableStates() [2/4]

template<class T >
requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isCompactNFA < T > || isExtendedNFA < T >

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

static

Finds all reachable states of a finite automaton. Using closure implementation of the BFS algorithm.

Template Parameters

T	type of finite automaton

Parameters

fsm

automaton

Returns

set of reachable states of fsm

Here is the caller graph for this function:

reachableStates() [3/4]

template<class T >
requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >

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

static

Finds all reachable states of a finite automaton with multiple initial states. Using closure implementation of the BFS algorithm.

Template Parameters

T	type of finite automaton with multiple initial states

Parameters

fsm

automaton

Returns

set of reachable states of fsm

reachableStates() [4/4]

template<class T >
requires isDFTA < T > || isNFTA < T >

static ext::set< typename T::StateType > automaton::properties::ReachableStates::reachableStates ( const T &  fta )

static

Finds all reachable states of a finite tree automaton. Using closure implementation of the BFS algorithm.

Template Parameters

T	type of finite tree automaton

Parameters

fta

automaton

Returns

set of reachable states of fta

---

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

• alib2algo/src/automaton/properties/ReachableStates.h