Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ToGrammar.h>
Static Public Member Functions | |
template<class T > requires isDFA < T > || isNFA < T > | |
static grammar::RightRG< typename T::SymbolType, typename T::StateType > | convert (const T &automaton) |
Conversion of finite automata to regular grammars. This class serves as a "default wrapper" over the conversion of FA to RG. It delegates to the right regular grammar conversion.
|
static |
Performs the conversion (
T | the converted automaton |
automaton | the automaton to convert |
automaton