Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <NPDTA.h>
Static Public Member Functions | |
static bool | used (const automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > &, const StateType &) |
static bool | available (const automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > &automaton, const StateType &state) |
static void | valid (const automaton::NPDTA< InputSymbolType, OutputSymbolType, PushdownStoreSymbolType, StateType > &, const StateType &) |
Helper class specifying constraints for the automaton's internal final states component.
InputSymbolType | used for the terminal alphabet of the automaton. |
OutputSymbolType | used for the output alphabet of the automaton. |
PushdownSymbolType | used for the pushdown store alphabet of the automaton. |
StateType | used for the terminal alphabet of the automaton. |
|
inlinestatic |
Determines whether the state is available in the automaton's states set.
automaton | the tested automaton |
state | the tested state |
|
inlinestatic |
Returns false. Final state is only a mark that the automaton itself does require further.
automaton | the tested automaton |
state | the tested state |
|
inlinestatic |
All states are valid as a final state of the automaton.
automaton | the tested automaton |
state | the tested state |