| Algorithms Library Toolkit
    A toolkit for algorithms, especially for algorithms on formal languages | 
#include <AutomatonComplement.h>
| Static Public Member Functions | |
| template<class SymbolType , class StateType > | |
| static automaton::DFA< SymbolType, StateType > | complement (const automaton::DFA< SymbolType, StateType > &automaton) | 
Complement of a finite automaton. For finite automaton A1, we create automaton A such that L(A) = complement(L(A1)). This is done by reversing the set of final states in the DFA.
| 
 | static | 
Complement of a deterministic finite automaton.
| SymbolType | Type for input symbols. | 
| StateType | Type for states. | 
| automaton | automaton to complement | 
automaton