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

#include <Total.h>

Static Public Member Functions

template<class T >
requires isDFA < T > || isNFA < T >
static T total (const T &automaton)
 
template<class T >
requires isDFTA < T > || isNFTA < T >
static T total (const T &automaton)
 

Detailed Description

Algorithm that makes finite automaton's transition function total (every state has a transition for every symbol). Implementation of Melichar: Jazyky a překlady, 2.22.

Member Function Documentation

◆ total() [1/2]

template<class T >
requires isDFA < T > || isNFA < T >
T automaton::simplify::Total::total ( const T &  automaton)
static

Makes a finite automaton's transition function total.

Template Parameters
Ttype of the automaton to make total.
Parameters
automatonautomaton to alter
Returns
an automaton equivalent to automaton with total transition function
Here is the call graph for this function:

◆ total() [2/2]

template<class T >
requires isDFTA < T > || isNFTA < T >
static T automaton::simplify::Total::total ( const T &  automaton)
static

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