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

#include <AutomatonIteration.h>

Static Public Member Functions

template<class Automaton >
requires isDFA < Automaton > || isNFA < Automaton >
static automaton::NFA< typename Automaton::SymbolType, typename Automaton::StateType > iteration (const Automaton &automaton)
 

Detailed Description

Iteration of a finite automaton. 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.82).

Member Function Documentation

◆ iteration()

template<class Automaton >
requires isDFA < Automaton > || isNFA < Automaton >
static automaton::NFA< typename Automaton::SymbolType, typename Automaton::StateType > automaton::transform::AutomatonIteration::iteration ( const Automaton &  automaton)
static

Iteration of a finite automaton.

Template Parameters
SymbolTypeType for input symbols.
StateTypeType for states.
Parameters
automatonautomaton to iterate
Returns
nondeterministic FA accepting the iteration of language that automaton accepted" );

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