Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#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) |
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.
|
static |
Makes a finite automaton's transition function total.
T | type of the automaton to make total. |
automaton | automaton to alter |
automaton
with total transition function
|
static |