Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <Compaction.h>
Static Public Member Functions | |
template<class T > requires isDFA < T > || isNFA < T > | |
static Compaction::CompactAutomaton< T > | convert (const T &automaton) |
template<class T > requires isCompactDFA < T > || isCompactNFA < T > | |
static T | convert (const T &automaton) |
Transformation of a finite automaton to a compact finite automaton. The compact automaton allows to use strings in the transition function. The transitions are compacted.
|
static |
Compaction of a finite automaton.
SymbolType | Type for input symbols. |
StateType | Type for states. |
automaton | automaton to compact |
automaton
|
static |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.