automaton::transform::AutomataUnion Class Reference

#include <AutomataUnion.h>

Static Public Member Functions
template<class SymbolType , class StateType >
static automaton::EpsilonNFA< SymbolType, ext::pair< StateType, unsigned > >	unification (const automaton::EpsilonNFA< SymbolType, StateType > &first, const automaton::EpsilonNFA< SymbolType, StateType > &second)
template<class SymbolType , class StateType >
static automaton::NFA< SymbolType, ext::pair< StateType, unsigned > >	unification (const automaton::NFA< SymbolType, StateType > &first, const automaton::NFA< SymbolType, StateType > &second)
template<class SymbolType , class StateType >
static automaton::NFA< SymbolType, ext::pair< StateType, unsigned > >	unification (const automaton::DFA< SymbolType, StateType > &first, const automaton::DFA< SymbolType, StateType > &second)

Detailed Description

Union of two finite automata. For finite automata A1, A2, we create a finite automaton A such that L(A) = L(A1) \cup L(A2). This method does not use epsilon transitions in finite automata (unless the original automata are epsilon automata).

Member Function Documentation

unification() [1/3]

template<class SymbolType , class StateType >

automaton::NFA< SymbolType, ext::pair< StateType, unsigned > > automaton::transform::AutomataUnion::unification ( const automaton::DFA< SymbolType, StateType > &  first, const automaton::DFA< SymbolType, StateType > &  second  )

static

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Here is the call graph for this function:

unification() [2/3]

template<class SymbolType , class StateType >

automaton::EpsilonNFA< SymbolType, ext::pair< StateType, unsigned > > automaton::transform::AutomataUnion::unification ( const automaton::EpsilonNFA< SymbolType, StateType > &  first, const automaton::EpsilonNFA< SymbolType, StateType > &  second  )

static

Union of two automata without transitions.

Template Parameters

SymbolType	Type for input symbols.
StateType	Type for states.

Parameters

first	First automaton (A1)
second	Second automaton (A2)

Returns

epsilon nondeterministic FA representing the union of two automata

Here is the call graph for this function:

unification() [3/3]

template<class SymbolType , class StateType >

automaton::NFA< SymbolType, ext::pair< StateType, unsigned > > automaton::transform::AutomataUnion::unification ( const automaton::NFA< SymbolType, StateType > &  first, const automaton::NFA< SymbolType, StateType > &  second  )

static

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Here is the call graph for this function:

---

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

• alib2algo/src/automaton/transform/AutomataUnion.h