Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <NFTA.h>
Static Public Member Functions | |
static bool | used (const automaton::NFTA< SymbolType, StateType > &automaton, const common::ranked_symbol< SymbolType > &symbol) |
static bool | available (const automaton::NFTA< SymbolType, StateType > &, const common::ranked_symbol< SymbolType > &) |
static void | valid (const automaton::NFTA< SymbolType, StateType > &, const common::ranked_symbol< SymbolType > &) |
Helper class specifying constraints for the automaton's internal input alphabet component.
SymbolType | used for the symbol part of the ranked symbol |
StateType | used for the terminal alphabet of the automaton. |
|
inlinestatic |
Returns true as all symbols are possibly available to be elements of the input alphabet.
automaton | the tested automaton |
symbol | the tested symbol |
|
inlinestatic |
Returns true if the symbol is still used in some transition of the automaton.
automaton | the tested automaton |
symbol | the tested symbol |
|
inlinestatic |
All symbols are valid as input symbols.
automaton | the tested automaton |
symbol | the tested symbol |