Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
automaton::transform::AutomatonComplement Class Reference

#include <AutomatonComplement.h>

Static Public Member Functions

template<class SymbolType , class StateType >
static automaton::DFA< SymbolType, StateTypecomplement (const automaton::DFA< SymbolType, StateType > &automaton)
 

Detailed Description

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.

Member Function Documentation

◆ complement()

template<class SymbolType , class StateType >
automaton::DFA< SymbolType, StateType > automaton::transform::AutomatonComplement::complement ( const automaton::DFA< SymbolType, StateType > &  automaton)
static

Complement of a deterministic finite automaton.

Template Parameters
SymbolTypeType for input symbols.
StateTypeType for states.
Parameters
automatonautomaton to complement
Returns
deterministic FA representing the complement of automaton

The documentation for this class was generated from the following file: