Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Concepts
Static Public Member Functions
automaton::convert::ToRegExp Class Reference

#include <ToRegExp.h>

Static Public Member Functions

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

Detailed Description

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.

See also
ToRegExpStateElimination

Member Function Documentation

◆ convert()

template<class T >
regexp::UnboundedRegExp< typename T::SymbolType > automaton::convert::ToRegExp::convert ( const T &  automaton)
static

Performs the conversion (

See also
ToRegExpStateElimination::convert).
Template Parameters
TType of converted automaton.
Parameters
automatonthe automaton to convert
Returns
regular expression equivalent to the input automaton
Here is the call graph for this function:

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