Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
automaton::convert::ToGrammar Class Reference

#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)
 

Detailed Description

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.

See also
ToGrammarRightRG

Member Function Documentation

◆ convert()

template<class T >
requires isDFA < T > || isNFA < T >
static grammar::RightRG< typename T::SymbolType, typename T::StateType > automaton::convert::ToGrammar::convert ( const T &  automaton)
static

Performs the conversion (

See also
ToGrammarRightRG::convert).
Template Parameters
Tthe converted automaton
Parameters
automatonthe automaton to convert
Returns
right regular grammar equivalent to the input automaton

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