automaton::convert::ToRTEStateElimination Class Reference

#include <ToRTEStateElimination.h>

Static Public Member Functions
template<class T , class SymbolType = DefaultSymbolType, class StateType = DefaultStateType>
static rte::FormalRTE< ext::variant< SymbolType, StateType > >	convert (const T &automaton)

Detailed Description

Converts a finite tree automaton to a regular tree expression using using the State Elimination algorithm (Travnicek: Not yet published) This algorithm returns the regular tree expression as rte::FormalRTE.

Member Function Documentation

convert()

template<class T , class SymbolType , class StateType >

rte::FormalRTE< ext::variant< SymbolType, StateType > > automaton::convert::ToRTEStateElimination::convert ( const T &  automaton )

static

Performs conversion.

Template Parameters

T	type of the finite tree automaton
SymbolType	the type of symbol of the automaton's input ranked alphabet
StateType	the type of states of the automaton

Parameters

automaton

finite tree automaton to convert

Returns

formal regular tree expression equivalent to the original automaton

Here is the call graph for this function:

---

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

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