ExtendedNFA.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <ostream>
 
#include <alib/multimap>
#include <alib/set>
 
#include <ext/algorithm>
 
#include <core/components.hpp>
#include <common/createUnique.hpp>
 
#include <common/DefaultStateType.h>
#include <common/DefaultSymbolType.h>
 
#include <label/InitialStateLabel.h>
#include <regexp/unbounded/UnboundedRegExpStructure.h>
#include <regexp/unbounded/UnboundedRegExpConcatenation.h>
#include <regexp/unbounded/UnboundedRegExpSymbol.h>
 
#include <automaton/AutomatonException.h>
 
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
 
#include "DFA.h"
#include "NFA.h"
#include "CompactNFA.h"
#include "EpsilonNFA.h"
#include "MultiInitialStateNFA.h"
 
namespace automaton {
 
class InputAlphabet;
class States;
class FinalStates;
class InitialState;
 
template < class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType >
class ExtendedNFA final : public core::Components < ExtendedNFA < SymbolTypeT, StateTypeT >, ext::set < SymbolTypeT >, component::Set, InputAlphabet, ext::set < StateTypeT >, component::Set, std::tuple < States, FinalStates >, StateTypeT, component::Value, InitialState > {
public:
    typedef SymbolTypeT SymbolType;
    typedef StateTypeT StateType;
 
private:
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > transitions;
 
public:
    explicit ExtendedNFA ( StateType initialState );
 
    explicit ExtendedNFA ( ext::set < StateType > states, ext::set < SymbolType > inputAlphabet, StateType initialState, ext::set < StateType > finalStates );
 
    /*
     * \brief Creates a new instance of the automaton based on the Compact nondeterministic finite automaton.
     *
     * \param other the Compact nondeterministic finite automaton
     */
    explicit ExtendedNFA ( const CompactNFA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Multi Initial State Epsilon Nondeterministic finite automaton.
     *
     * \param other the Multi Initial State Epsilon Nondeterministic finite automaton
     */
    explicit ExtendedNFA ( const MultiInitialStateEpsilonNFA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Epsilon Nondeterministic finite automaton.
     *
     * \param other the Epsilon nondeterministic finite automaton
     */
    explicit ExtendedNFA ( const EpsilonNFA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Nondeterministic finite automaton with multiple initial states.
     *
     * \param other the Nondeterministic finite automaton with multiple initial states
     */
    explicit ExtendedNFA ( const MultiInitialStateNFA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Nondeterministic finite automaton.
     *
     * \param other the Nondeterministic finite automaton
     */
    explicit ExtendedNFA ( const NFA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Deterministic finite automaton.
     *
     * \param other the Deterministic finite automaton
     */
    explicit ExtendedNFA ( const DFA < SymbolType, StateType > & other );
 
    const StateType & getInitialState ( ) const & {
        return this->template accessComponent < InitialState > ( ).get ( );
    }
 
    StateType && getInitialState ( ) && {
        return std::move ( this->template accessComponent < InitialState > ( ).get ( ) );
    }
 
    bool setInitialState ( StateType state ) {
        return this->template accessComponent < InitialState > ( ).set ( std::move ( state ) );
    }
 
    const ext::set < StateType > & getStates ( ) const & {
        return this->template accessComponent < States > ( ).get ( );
    }
 
    ext::set < StateType > && getStates ( ) && {
        return std::move ( this->template accessComponent < States > ( ).get ( ) );
    }
 
    bool addState ( StateType state ) {
        return this->template accessComponent < States > ( ).add ( std::move ( state ) );
    }
 
    void setStates ( ext::set < StateType > states ) {
        this->template accessComponent < States > ( ).set ( std::move ( states ) );
    }
 
    void removeState ( const StateType & state ) {
        this->template accessComponent < States > ( ).remove ( state );
    }
 
    const ext::set < StateType > & getFinalStates ( ) const & {
        return this->template accessComponent < FinalStates > ( ).get ( );
    }
 
    ext::set < StateType > && getFinalStates ( ) && {
        return std::move ( this->template accessComponent < FinalStates > ( ).get ( ) );
    }
 
    bool addFinalState ( StateType state ) {
        return this->template accessComponent < FinalStates > ( ).add ( std::move ( state ) );
    }
 
    void setFinalStates ( ext::set < StateType > states ) {
        this->template accessComponent < FinalStates > ( ).set ( std::move ( states ) );
    }
 
    void removeFinalState ( const StateType & state ) {
        this->template accessComponent < FinalStates > ( ).remove ( state );
    }
 
    const ext::set < SymbolType > & getInputAlphabet ( ) const & {
        return this->template accessComponent < InputAlphabet > ( ).get ( );
    }
 
    ext::set < SymbolType > && getInputAlphabet ( ) && {
        return std::move ( this->template accessComponent < InputAlphabet > ( ).get ( ) );
    }
 
    bool addInputSymbol ( SymbolType symbol ) {
        return this->template accessComponent < InputAlphabet > ( ).add ( std::move ( symbol ) );
    }
 
    void addInputSymbols ( ext::set < SymbolType > symbols ) {
        this->template accessComponent < InputAlphabet > ( ).add ( std::move ( symbols ) );
    }
 
    void setInputAlphabet ( ext::set < SymbolType > symbols ) {
        this->template accessComponent < InputAlphabet > ( ).set ( std::move ( symbols ) );
    }
 
    void removeInputSymbol ( const SymbolType & symbol ) {
        this->template accessComponent < InputAlphabet > ( ).remove ( symbol );
    }
 
    bool addTransition ( StateType from, regexp::UnboundedRegExpStructure < SymbolType > input, StateType to );
 
    bool removeTransition ( const StateType & from, const regexp::UnboundedRegExpStructure < SymbolType > & input, const StateType & to );
 
    const ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & getTransitions ( ) const &;
 
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > && getTransitions ( ) &&;
 
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > getTransitionsFromState ( const StateType & from ) const;
 
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > getTransitionsToState ( const StateType & to ) const;
 
    auto operator <=> ( const ExtendedNFA & other ) const {
        return std::tie ( getStates ( ), getInputAlphabet ( ), getInitialState ( ), getFinalStates ( ), transitions ) <=> std::tie ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ), other.getTransitions ( ) );
    }
 
    bool operator == ( const ExtendedNFA & other ) const {
        return std::tie ( getStates ( ), getInputAlphabet ( ), getInitialState ( ), getFinalStates ( ), transitions ) == std::tie ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ), other.getTransitions ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const ExtendedNFA & instance ) {
        return out << "(ExtendedNFA"
               << " states = " << instance.getStates ( )
               << " inputAlphabet = " << instance.getInputAlphabet ( )
               << " initialState = " << instance.getInitialState ( )
               << " finalStates = " << instance.getFinalStates ( )
               << " transitions = " << instance.getTransitions ( )
               << ")";
    }
};
 
template < class T >
class isExtendedNFA_impl : public std::false_type {};
 
template < class SymbolType, class StateType >
class isExtendedNFA_impl < ExtendedNFA < SymbolType, StateType > > : public std::true_type {};
 
template < class T >
constexpr bool isExtendedNFA = isExtendedNFA_impl < T > { };
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( ext::set < StateType > states, ext::set < SymbolType > inputAlphabet, StateType initialState, ext::set < StateType > finalStates ) : core::Components < ExtendedNFA, ext::set < SymbolType >, component::Set, InputAlphabet, ext::set < StateType >, component::Set, std::tuple < States, FinalStates >, StateType, component::Value, InitialState > ( std::move ( inputAlphabet ), std::move ( states ), std::move ( finalStates ), std::move ( initialState ) ) {
}
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( StateType initialState ) : ExtendedNFA ( ext::set < StateType > { initialState }, ext::set < SymbolType > { }, initialState, ext::set < StateType > { } ) {
}
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const CompactNFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        regexp::UnboundedRegExpConcatenation < SymbolType > con;
 
        for ( auto & symbol : transition.first.second )
            con.appendElement ( regexp::UnboundedRegExpSymbol < SymbolType > ( symbol ) );
 
        ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( std::move ( con ) ) );
        transitions.insert ( key, transition.second );
    }
}
 
template < class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const MultiInitialStateEpsilonNFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ) + ext::set < StateType > { common::createUnique ( label::InitialStateLabel::instance < StateType > ( ), other.getStates ( ) ) }, other.getInputAlphabet ( ), common::createUnique ( label::InitialStateLabel::instance < StateType > ( ), other.getStates ( ) ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        if ( transition.first.second.is_epsilon ( ) ) {
            ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpEpsilon < SymbolType > ( ) ) );
            transitions.insert ( key, transition.second );
        } else {
            ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpSymbol < SymbolType > ( transition.first.second.getSymbol ( ) ) ) );
            transitions.insert ( key, transition.second );
        }
    }
 
    ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( this->getInitialState ( ), regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpEpsilon < SymbolType > ( ) ) );
    for ( const StateType & to : other.getInitialStates ( ) )
        transitions.insert ( key, to );
}
 
template < class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const EpsilonNFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        if ( transition.first.second.is_epsilon ( ) ) {
            ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpEpsilon < SymbolType > ( ) ) );
            transitions.insert ( key, transition.second );
        } else {
            ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpSymbol < SymbolType > ( transition.first.second.getSymbol ( ) ) ) );
            transitions.insert ( key, transition.second );
        }
    }
}
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const MultiInitialStateNFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ) + ext::set < StateType > { common::createUnique ( label::InitialStateLabel::instance < StateType > ( ), other.getStates ( ) ) }, other.getInputAlphabet ( ), common::createUnique ( label::InitialStateLabel::instance < StateType > ( ), other.getStates ( ) ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpSymbol < SymbolType > ( transition.first.second ) ) );
        transitions.insert ( key, transition.second );
    }
 
    ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( this->getInitialState ( ), regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpEpsilon < SymbolType > ( ) ) );
    for ( const StateType & state : other.getInitialStates ( ) )
        transitions.insert ( key, state );
}
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const NFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpSymbol < SymbolType > ( transition.first.second ) ) );
        transitions.insert ( key, transition.second );
    }
}
 
template<class SymbolType, class StateType >
ExtendedNFA < SymbolType, StateType >::ExtendedNFA ( const DFA < SymbolType, StateType > & other ) : ExtendedNFA ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) ) {
        ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( transition.first.first, regexp::UnboundedRegExpStructure < SymbolType > ( regexp::UnboundedRegExpSymbol < SymbolType > ( transition.first.second ) ) );
        transitions.insert ( key, transition.second );
    }
}
 
template<class SymbolType, class StateType >
bool ExtendedNFA < SymbolType, StateType >::addTransition ( StateType from, regexp::UnboundedRegExpStructure < SymbolType > input, StateType to ) {
    if ( ! getStates ( ).contains ( from ) )
        throw AutomatonException ( "State \"" + ext::to_string ( from ) + "\" doesn't exist." );
 
    ext::set < SymbolType > inputRegExpAlphabet = input.getStructure ( ).computeMinimalAlphabet ( );
 
    // Transition regexp's alphabet must be subset of automaton's alphabet
    if ( ! std::includes ( getInputAlphabet ( ).begin ( ), getInputAlphabet ( ).end ( ), inputRegExpAlphabet.begin ( ), inputRegExpAlphabet.end ( ) ) )
        throw AutomatonException ( "Input string is over different alphabet than automaton" );
 
    if ( ! getStates ( ).contains ( to ) )
        throw AutomatonException ( "State \"" + ext::to_string ( to ) + "\" doesn't exist." );
 
    auto upper_bound = transitions.upper_bound ( ext::tie ( from, input ) );
    auto lower_bound = transitions.lower_bound ( ext::tie ( from, input ) );
    auto iter = std::lower_bound ( lower_bound, upper_bound, to, [ ] ( const auto & transition, const auto & target ) { return transition.second < target; } );
    if ( iter != upper_bound && to >= iter->second )
        return false;
 
    ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > > key = ext::make_pair ( std::move ( from ), std::move ( input ) );
    transitions.insert ( iter, std::make_pair ( std::move ( key ), std::move ( to ) ) );
    return true;
}
 
template<class SymbolType, class StateType >
bool ExtendedNFA < SymbolType, StateType >::removeTransition ( const StateType & from, const regexp::UnboundedRegExpStructure < SymbolType > & input, const StateType & to ) {
    auto upper_bound = transitions.upper_bound ( ext::tie ( from, input ) );
    auto lower_bound = transitions.lower_bound ( ext::tie ( from, input ) );
    auto iter = std::find_if ( lower_bound, upper_bound, [ & ] ( const auto & transition ) { return transition.second == to; } );
    if ( iter == upper_bound )
        return false;
 
    transitions.erase ( iter );
    return true;
}
 
template<class SymbolType, class StateType >
const ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & ExtendedNFA < SymbolType, StateType >::getTransitions ( ) const & {
    return transitions;
}
 
template<class SymbolType, class StateType >
ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > && ExtendedNFA < SymbolType, StateType >::getTransitions ( ) && {
    return std::move ( transitions );
}
 
template<class SymbolType, class StateType >
ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > ExtendedNFA < SymbolType, StateType >::getTransitionsFromState ( const StateType & from ) const {
    if ( ! getStates ( ).contains ( from ) )
        throw AutomatonException ( "State \"" + ext::to_string ( from ) + "\" doesn't exist" );
 
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > transitionsFromState;
 
    for ( const std::pair < const ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & transition : transitions )
        if ( transition.first.first == from )
            transitionsFromState.insert ( transition );
 
    return transitionsFromState;
}
 
template<class SymbolType, class StateType >
ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > ExtendedNFA < SymbolType, StateType >::getTransitionsToState ( const StateType & to ) const {
    if ( ! getStates ( ).contains ( to ) )
        throw AutomatonException ( "State \"" + ext::to_string ( to ) + "\" doesn't exist" );
 
    ext::multimap < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > transitionsToState;
 
    for ( const std::pair < const ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & transition : transitions )
        if ( transition.second == to )
            transitionsToState.insert ( transition );
 
    return transitionsToState;
}
 
} /* namespace automaton */
 
namespace core {
 
template<class SymbolType, class StateType >
class SetConstraint< automaton::ExtendedNFA < SymbolType, StateType >, SymbolType, automaton::InputAlphabet > {
public:
    static bool used ( const automaton::ExtendedNFA < SymbolType, StateType > & automaton, const SymbolType & symbol ) {
        for ( const std::pair < const ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & transition : automaton.getTransitions ( ) ) {
            ext::set < SymbolType > alphabet = transition.first.second.getStructure ( ).computeMinimalAlphabet ( );
            if ( alphabet.contains ( symbol ) )
                return true;
        }
 
        return false;
    }
 
    static bool available ( const automaton::ExtendedNFA < SymbolType, StateType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const automaton::ExtendedNFA < SymbolType, StateType > &, const SymbolType & ) {
    }
};
 
template<class SymbolType, class StateType >
class SetConstraint< automaton::ExtendedNFA < SymbolType, StateType >, StateType, automaton::States > {
public:
    static bool used ( const automaton::ExtendedNFA < SymbolType, StateType > & automaton, const StateType & state ) {
        if ( automaton.getInitialState ( ) == state )
            return true;
 
        if ( automaton.getFinalStates ( ).contains ( state ) )
            return true;
 
        for ( const std::pair < const ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > & transition : automaton.getTransitions ( ) )
            if ( transition.first.first == state || transition.second == state )
                return true;
 
        return false;
    }
 
    static bool available ( const automaton::ExtendedNFA < SymbolType, StateType > &, const StateType & ) {
        return true;
    }
 
    static void valid ( const automaton::ExtendedNFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template<class SymbolType, class StateType >
class SetConstraint< automaton::ExtendedNFA < SymbolType, StateType >, StateType, automaton::FinalStates > {
public:
    static bool used ( const automaton::ExtendedNFA < SymbolType, StateType > &, const StateType & ) {
    return false;
}
 
    static bool available ( const automaton::ExtendedNFA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).contains ( state );
    }
 
    static void valid ( const automaton::ExtendedNFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template<class SymbolType, class StateType >
class ElementConstraint< automaton::ExtendedNFA < SymbolType, StateType >, StateType, automaton::InitialState > {
public:
    static bool available ( const automaton::ExtendedNFA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).contains ( state );
    }
 
    static void valid ( const automaton::ExtendedNFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
struct normalize < automaton::ExtendedNFA < SymbolType, StateType > > {
    static automaton::ExtendedNFA < > eval ( automaton::ExtendedNFA < SymbolType, StateType > && value ) {
        ext::set < DefaultSymbolType > alphabet = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( value ).getInputAlphabet ( ) );
        ext::set < DefaultStateType > states = automaton::AutomatonNormalize::normalizeStates ( std::move ( value ).getStates ( ) );
        DefaultStateType initialState = automaton::AutomatonNormalize::normalizeState ( std::move ( value ).getInitialState ( ) );
        ext::set < DefaultStateType > finalStates = automaton::AutomatonNormalize::normalizeStates ( std::move ( value ).getFinalStates ( ) );
 
        automaton::ExtendedNFA < > res ( std::move ( states ), std::move ( alphabet ), std::move ( initialState ), std::move ( finalStates ) );
 
        for ( std::pair < ext::pair < StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType > && transition : ext::make_mover ( std::move ( value ).getTransitions ( ) ) ) {
            DefaultStateType from = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.first.first ) );
            regexp::UnboundedRegExpStructure < DefaultSymbolType > input = automaton::AutomatonNormalize::normalizeRegExp ( std::move ( transition.first.second ) );
            DefaultStateType target = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.second ) );
 
            res.addTransition ( std::move ( from ), std::move ( input ), std::move ( target ) );
        }
 
        return res;
    }
};
 
} /* namespace core */
 
extern template class automaton::ExtendedNFA < >;