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

#include <ToGrammarRightRG.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

Converts a finite automaton to a right regular grammar (Melichar: Jazyky a překlady 2.104).

Member Function Documentation

◆ convert()

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

Performs the conversion of the finite automaton to right regular grammar.

Template Parameters
Tthe converted automaton
Parameters
automatona finite automaton to convert
Returns
right regular grammar equivalent to the source automaton.

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