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 |
| DFA (void) |
| Initialize for DFA accepting the empty word.
|
| DFA (int s, Transition t[], int f[], bool minimize=true) |
| Initialize DFA.
|
| DFA (const DFA &d) |
| Initialize by DFA d (DFA is shared)
|
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.
|
Related Functions |
(Note that these are not member functions.)
|
template<class Char , class Traits > |
std::basic_ostream< Char,
Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const DFA &d) |
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.
Definition at line 1753 of file int.hh.