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

#include <EpsilonRemoverIncoming.h>

Static Public Member Functions

template<class SymbolType , class StateType >
static automaton::NFA< SymbolType, StateType > remove (const automaton::EpsilonNFA< SymbolType, StateType > &fsm)
 
template<class SymbolType , class StateType >
static automaton::MultiInitialStateNFA< SymbolType, StateType > remove (const automaton::MultiInitialStateNFA< SymbolType, StateType > &fsm)
 
template<class SymbolType , class StateType >
static automaton::NFA< SymbolType, StateType > remove (const automaton::NFA< SymbolType, StateType > &fsm)
 
template<class SymbolType , class StateType >
static automaton::DFA< SymbolType, StateType > remove (const automaton::DFA< SymbolType, StateType > &fsm)
 

Detailed Description

Removes epsilon transitions from an automaton. This method is the one teached at BI-AAG course.

See also
automaton::simplify::EpsilonRemoverOutgoing

Member Function Documentation

◆ remove() [1/4]

template<class SymbolType , class StateType >
automaton::DFA< SymbolType, StateType > automaton::simplify::EpsilonRemoverIncoming::remove ( const automaton::DFA< SymbolType, StateType > &  fsm)
static

For deterministic finite automata, we remove nothing and return the res

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

◆ remove() [2/4]

template<class SymbolType , class StateType >
automaton::NFA< SymbolType, StateType > automaton::simplify::EpsilonRemoverIncoming::remove ( const automaton::EpsilonNFA< SymbolType, StateType > &  fsm)
static

Removes epsilon transitions from an automaton.

Template Parameters
SymbolTypeType for input symbols.
StateTypeType for states.
Parameters
resautomaton to remove epsilon transitions from
Returns
an automaton equivalent to res but without epsilon transitions

Step 1 from Melichar 2.41

Step 2 from Melichar 2.41

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

◆ remove() [3/4]

template<class SymbolType , class StateType >
automaton::MultiInitialStateNFA< SymbolType, StateType > automaton::simplify::EpsilonRemoverIncoming::remove ( const automaton::MultiInitialStateNFA< SymbolType, StateType > &  fsm)
static

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

◆ remove() [4/4]

template<class SymbolType , class StateType >
automaton::NFA< SymbolType, StateType > automaton::simplify::EpsilonRemoverIncoming::remove ( const automaton::NFA< SymbolType, StateType > &  fsm)
static

For nondeterministic finite automata, we remove nothing and return the res

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


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