Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ToRegExp.h>
Static Public Member Functions | |
template<class T > | |
static regexp::UnboundedRegExp< typename T::SymbolType > | convert (const T &automaton) |
Conversion of finite automata to regular expressions. This class serves as a "default wrapper" over the conversion of FA to RE. It delegates to the State Elimination algorithm.
|
static |
Performs the conversion (
T | Type of converted automaton. |
automaton | the automaton to convert |
automaton