
Deterministic finite automaton (DFA) More...
#include <int.hh>
Classes | |
| class | DFAI |
| Data stored for a DFA. More... | |
| class | Symbols |
| Iterator for DFA symbols. More... | |
| class | Transition |
| Specification of a DFA transition. More... | |
| class | Transitions |
| Iterator for DFA transitions (sorted by symbols) More... | |
Public Member Functions | |
| void | init (int s, Transition t[], int f[], bool minimize=true) |
| Initialize DFA. | |
| DFA (void) | |
| Initialize for DFA accepting the empty word. | |
| DFA (int s, Transition t[], int f[], bool minimize=true) | |
| Initialize DFA. | |
| DFA (int s, std::initializer_list< Transition > t, std::initializer_list< int > f, bool minimize=true) | |
| Initialize DFA. | |
| DFA (const DFA &d) | |
| Initialize by DFA d (DFA is shared) | |
| bool | operator== (const DFA &d) const |
| Test whether DFA is equal to d. | |
| bool | operator!= (const DFA &d) const |
| Test whether DFA is not equal to d. | |
| int | n_states (void) const |
| Return the number of states. | |
| int | n_transitions (void) const |
| Return the number of transitions. | |
| unsigned int | n_symbols (void) const |
| Return the number of symbols. | |
| unsigned int | max_degree (void) const |
| Return maximal degree (in-degree and out-degree) of any state. | |
| int | final_fst (void) const |
| Return the number of the first final state. | |
| int | final_lst (void) const |
| Return the number of the last final state. | |
| int | symbol_min (void) const |
| Return smallest symbol in DFA. | |
| int | symbol_max (void) const |
| Return largest symbol in DFA. | |
| std::size_t | hash (void) const |
| Return hash key. | |
| Public Member Functions inherited from Gecode::SharedHandle | |
| SharedHandle (void) | |
| Create shared handle with no object pointing to. | |
| SharedHandle (SharedHandle::Object *so) | |
| Create shared handle that points to shared object so. | |
| SharedHandle (const SharedHandle &sh) | |
| Copy constructor maintaining reference count. | |
| SharedHandle & | operator= (const SharedHandle &sh) |
| Assignment operator maintaining reference count. | |
| ~SharedHandle (void) | |
| Destructor that maintains reference count. | |
| operator bool (void) const | |
| Whether handle points to an object. | |
Related Symbols | |
(Note that these are not member symbols.) | |
| template<class Char, class Traits> | |
| std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const DFA &d) |
Additional Inherited Members | |
| Protected Member Functions inherited from Gecode::SharedHandle | |
| SharedHandle::Object * | object (void) const |
| Access to the shared object. | |
| void | object (SharedHandle::Object *n) |
| Modify shared object. | |
Deterministic finite automaton (DFA)
After initialization, the start state is always zero. The final states are contiguous ranging from the first to the last final state.
|
inline |
| Gecode::DFA::DFA | ( | int | s, |
| Transition | t[], | ||
| int | f[], | ||
| bool | minimize = true ) |
| Gecode::DFA::DFA | ( | int | s, |
| std::initializer_list< Transition > | t, | ||
| std::initializer_list< int > | f, | ||
| bool | minimize = true ) |
|
inline |
| void Gecode::DFA::init | ( | int | s, |
| Transition | t[], | ||
| int | f[], | ||
| bool | minimize = true ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|