automaton::properties::UsefulStates Class Reference

#include <UsefulStates.h>

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

Detailed Description

Find all useful states of an automaton. A state is useful if there exists any sequence of transitions that leads to the final state.

Member Function Documentation

usefulStates() [1/3]

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

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

static

Finds all useful states of a arc-factored z-automaton. Using closure implementation of the BFS algorithm.

Template Parameters

T	type of finite tree automaton

Parameters

afza

automaton

Returns

set of useful states of afza

usefulStates() [2/3]

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

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

static

Finds all useful 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 useful states of fsm

Here is the caller graph for this function:

usefulStates() [3/3]

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

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

static

Finds all useful 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 useful states of fta

---

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

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