Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <ToGrammarLeftRG.h>
Static Public Member Functions | |
template<class T > requires isDFA < T > || isNFA < T > | |
static grammar::LeftRG< typename T::SymbolType, typename T::StateType > | convert (const T &automaton) |
Converts a finite automaton to a left regular grammar.
|
static |
Performs the conversion of the finite automaton to left regular grammar.
T | the converted automaton |
automaton | a finite automaton to convert |
automaton
.