automaton::convert::ToRegExpStateElimination Class Reference

#include <ToRegExpStateElimination.h>

Static Public Member Functions
template<class T >
static regexp::UnboundedRegExp< typename T::SymbolType >	convert (const T &automaton)

Detailed Description

Converts a finite automaton to a regular expression using using the State Elimination algorithm (Melichar: Jazyky a překlady 2.118). This algorithm returns the regular expression as regexp::UnboundedRegExp.

Member Function Documentation

convert()

template<class T >

regexp::UnboundedRegExp< typename T::SymbolType > automaton::convert::ToRegExpStateElimination::convert ( const T &  automaton )

static

Performs conversion.

Template Parameters

T	type of the finite automaton
SymbolType	the type of input symbols of the accepted automaton
StateType	the type of states of the accepted automaton

Parameters

automaton

finite automaton to convert

Returns

unbounded regular expression equivalent to the original automaton

Here is the call graph for this function:

Here is the caller graph for this function:

---

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

• alib2algo/src/automaton/convert/ToRegExpStateElimination.h