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

#include <AutomatonIterationEpsilonTransition.h>

Static Public Member Functions

template<class T >
static automaton::EpsilonNFA< typename T::SymbolType, typename T::StateType > iteration (const T &automaton)
 

Detailed Description

Iteration of a finite automaton using epsilon transitions. For finite automaton A1, we create automaton A such that L(A) = L(A1)* This method utilizes epsilon transitions in finite automata (Melichar: Jazyky a překlady, 2.84).

Member Function Documentation

◆ iteration()

template<class T >
automaton::EpsilonNFA< typename T::SymbolType, typename T::StateType > automaton::transform::AutomatonIterationEpsilonTransition::iteration ( const T &  automaton)
static

Iteration of a finite automaton using epsilon transitions.

Template Parameters
TType of the finite automaton.
Parameters
automatonautomaton to iterate
Returns
epsilon nondeterministic FA representing the intersection of automaton
Here is the call graph for this function:

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