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

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

Detailed Description

Converts a finite automaton to a left regular grammar.

Member Function Documentation

◆ convert()

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

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

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

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