automaton::properties::AllEpsilonClosure Class Reference

#include <AllEpsilonClosure.h>

Static Public Member Functions
template<class T > requires isEpsilonNFA < T > || isEpsilonNFTA < T >
static ext::map< typename T::StateType, ext::set< typename T::StateType > >	allEpsilonClosure (const T &fsm)
template<class T > requires isDFA < T > || isNFA < T > || isMultiInitialStateNFA < T >
static ext::map< typename T::StateType, ext::set< typename T::StateType > >	allEpsilonClosure (const T &fsm)
template<class SymbolType , class StateType >
static ext::map< StateType, ext::set< StateType > >	allEpsilonClosure (const automaton::ExtendedNFA< SymbolType, StateType > &fsm)
template<class SymbolType , class StateType >
static ext::map< StateType, ext::set< StateType > >	allEpsilonClosure (const automaton::CompactNFA< SymbolType, StateType > &fsm)
template<class SymbolType , class StateType >
static ext::map< StateType, ext::set< StateType > >	allEpsilonClosure (const automaton::NondeterministicZAutomaton< SymbolType, StateType > &fsm)

Detailed Description

Algorithm computing an epsilon closure for all states of a finite automaton.

Member Function Documentation

allEpsilonClosure() [1/5]

template<class SymbolType , class StateType >

ext::map< StateType, ext::set< StateType > > automaton::properties::AllEpsilonClosure::allEpsilonClosure ( const automaton::CompactNFA< SymbolType, StateType > &  fsm )

static

Computes epsilon closure for all states of a compact nondeterministic finite automaton. Any string of size 0 is considered as epsilon.

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Template Parameters

SymbolType	Type for the input symbols.
StateType	Type for the states.

Parameters

fsm	compact nondeterministic finite automaton

Returns

mapping of states to set of states representing the epsilon closures for each state of fsm

Here is the call graph for this function:

allEpsilonClosure() [2/5]

template<class SymbolType , class StateType >

ext::map< StateType, ext::set< StateType > > automaton::properties::AllEpsilonClosure::allEpsilonClosure ( const automaton::ExtendedNFA< SymbolType, StateType > &  fsm )

static

Computes epsilon closure for all states of an extended nondeterministic finite automaton. Any regexp that can denote epsilon word is considered as an epsilon transition for the purpose of this algorithm.

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Template Parameters

SymbolType	Type for the input symbols.
StateType	Type for the states.

Parameters

fsm	extended nondeterministic finite automaton

Returns

mapping of states to set of states representing the epsilon closures for each state of fsm

Here is the call graph for this function:

allEpsilonClosure() [3/5]

template<class SymbolType , class StateType >

ext::map< StateType, ext::set< StateType > > automaton::properties::AllEpsilonClosure::allEpsilonClosure ( const automaton::NondeterministicZAutomaton< SymbolType, StateType > &  fsm )

static

Here is the call graph for this function:

allEpsilonClosure() [4/5]

template<class T >
requires isEpsilonNFA < T > || isEpsilonNFTA < T >

static ext::map< typename T::StateType, ext::set< typename T::StateType > > automaton::properties::AllEpsilonClosure::allEpsilonClosure ( const T &  fsm )

static

Computes epsilon closure for all states of a nondeterministic finite (tree) automaton with epsilon transitions. Implemented using closures (breadth-first search).

Template Parameters

T	type of tested automaton.

Parameters

fsm	nondeterministic finite (tree) automaton with epsilon transitions

Returns

mapping of states to set of states representing the epsilon closures for each state of fsm

Here is the caller graph for this function:

allEpsilonClosure() [5/5]

template<class T >
requires isDFA < T > || isNFA < T > || isMultiInitialStateNFA < T >

static ext::map< typename T::StateType, ext::set< typename T::StateType > > automaton::properties::AllEpsilonClosure::allEpsilonClosure ( const T &  fsm )

static

Computes epsilon closure for all states of a nondeterministic finite automaton with multiple initial states. Epsilon closure of a state q of an automaton without epsilon transitions is eps-closure(q) = {q}.

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Template Parameters

T	type of tested automaton.

Parameters

fsm	(nondeterministic) finite automaton (with multiple initial states)

Returns

mapping of states to set of states representing the epsilon closures for each state of fsm

---

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

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