NFTA.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 <alib/vector>
 
#include <core/components.hpp>
 
#include <core/normalize.hpp>
 
#include <common/DefaultStateType.h>
#include <common/DefaultSymbolType.h>
 
#include <automaton/AutomatonException.h>
 
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
 
#include "DFTA.h"
 
namespace automaton {
 
class InputAlphabet;
class States;
class FinalStates;
 
template < class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType >
class NFTA final : public core::Components < NFTA < SymbolTypeT, StateTypeT >, ext::set < common::ranked_symbol < SymbolTypeT > >, component::Set, InputAlphabet, ext::set < StateTypeT >, component::Set, std::tuple < States, FinalStates > > {
public:
    typedef SymbolTypeT SymbolType;
    typedef StateTypeT StateType;
 
private:
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > transitions;
 
public:
    explicit NFTA ( );
 
    explicit NFTA ( ext::set < StateType > states, ext::set < common::ranked_symbol < SymbolType > > inputAlphabet, ext::set < StateType > finalStates );
 
    /*
     * \brief Creates a new instance of the automaton based on the Deterministic finite tree automaton.
     *
     * \param other the Deterministic finite tree automaton
     */
    explicit NFTA ( const DFTA < SymbolType, StateType > & other );
 
    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 < common::ranked_symbol < SymbolType > > & getInputAlphabet ( ) const & {
        return this->template accessComponent < InputAlphabet > ( ).get ( );
    }
 
    ext::set < common::ranked_symbol < SymbolType > > && getInputAlphabet ( ) && {
        return std::move ( this->template accessComponent < InputAlphabet > ( ).get ( ) );
    }
 
    bool addInputSymbol ( common::ranked_symbol < SymbolType > symbol ) {
        return this->template accessComponent < InputAlphabet > ( ).add ( std::move ( symbol ) );
    }
 
    void addInputSymbols ( ext::set < common::ranked_symbol < SymbolType > > symbols ) {
        this->template accessComponent < InputAlphabet > ( ).add ( std::move ( symbols ) );
    }
 
    void setInputAlphabet ( ext::set < common::ranked_symbol < SymbolType > > symbols ) {
        this->template accessComponent < InputAlphabet > ( ).set ( std::move ( symbols ) );
    }
 
    void removeInputSymbol ( const common::ranked_symbol < SymbolType > & symbol ) {
        this->template accessComponent < InputAlphabet > ( ).remove ( symbol );
    }
 
    bool addTransition ( common::ranked_symbol < SymbolType > symbol, ext::vector < StateType > prevStates, StateType next );
 
    bool removeTransition ( const common::ranked_symbol < SymbolType > & symbol, const ext::vector < StateType > & states, const StateType & next );
 
    const ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > & getTransitions ( ) const & {
        return transitions;
    }
 
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > && getTransitions ( ) && {
        return std::move ( transitions );
    }
 
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > getTransitionsToState ( const StateType & q ) const {
        ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > res;
 
        for ( const auto & transition : getTransitions ( ) )
            if ( transition.second == q )
                res.insert ( transition );
 
        return res;
    }
 
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > getTransitionsFromState ( const StateType & q ) const {
        ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > res;
 
        for ( const auto & transition : getTransitions ( ) ) {
            if ( std::find ( transition.first.second.begin ( ), transition.first.second.end ( ), q ) != transition.first.second.end ( ) )
                res.insert ( transition );
        }
 
        return res;
    }
 
    bool isDeterministic ( ) const;
 
    auto operator <=> ( const NFTA & other ) const {
        return std::tie(getStates(), getInputAlphabet(), getFinalStates(), transitions) <=> std::tie(other.getStates(), other.getInputAlphabet(), other.getFinalStates(), other.transitions);
    }
 
    bool operator == ( const NFTA & other ) const {
        return std::tie(getStates(), getInputAlphabet(), getFinalStates(), transitions) == std::tie(other.getStates(), other.getInputAlphabet(), other.getFinalStates(), other.transitions);
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const NFTA & instance ) {
        return out << "(NFTA"
               << " states = " << instance.getStates ( )
               << " inputAlphabet = " << instance.getInputAlphabet ( )
               << " finalStates = " << instance.getFinalStates ( )
               << " transitions = " << instance.getTransitions ( )
               << ")";
    }
};
 
template < class T >
class isNFTA_impl : public std::false_type {};
 
template < class SymbolType, class StateType >
class isNFTA_impl < NFTA < SymbolType, StateType > > : public std::true_type {};
 
template < class T >
constexpr bool isNFTA = isNFTA_impl < T > { };
 
template < class SymbolType, class StateType >
NFTA < SymbolType, StateType >::NFTA ( ext::set < StateType > states, ext::set < common::ranked_symbol < SymbolType > > inputAlphabet, ext::set < StateType > finalStates ) : core::Components < NFTA, ext::set < common::ranked_symbol < SymbolType > >, component::Set, InputAlphabet, ext::set < StateType >, component::Set, std::tuple < States, FinalStates > > ( std::move ( inputAlphabet ), std::move ( states ), std::move ( finalStates ) ) {
}
 
template < class SymbolType, class StateType >
NFTA < SymbolType, StateType >::NFTA() : NFTA ( ext::set < StateType > { }, ext::set < common::ranked_symbol < SymbolType > > { }, ext::set < StateType > { } ) {
}
 
template < class SymbolType, class StateType >
NFTA < SymbolType, StateType >::NFTA(const DFTA < SymbolType, StateType > & other) : NFTA ( other.getStates(), other.getInputAlphabet(), other.getFinalStates() ) {
    transitions.insert ( other.getTransitions ( ).begin ( ), other.getTransitions ( ).end ( ) );
}
 
template < class SymbolType, class StateType >
bool NFTA < SymbolType, StateType >::addTransition ( common::ranked_symbol < SymbolType > symbol, ext::vector<StateType> prevStates, StateType next) {
    if ( prevStates.size ( ) != symbol.getRank ( ) )
        throw AutomatonException("Number of states doesn't match rank of the symbol");
 
    if (! getInputAlphabet().count(symbol))
        throw AutomatonException("Input symbol \"" + ext::to_string ( symbol ) + "\" doesn't exist.");
 
    if (! getStates().count(next))
        throw AutomatonException("State \"" + ext::to_string ( next ) + "\" doesn't exist.");
 
    for (const StateType& it : prevStates) {
        if (! getStates().count(it))
            throw AutomatonException("State \"" + ext::to_string ( it ) + "\" doesn't exist.");
    }
 
    auto upper_bound = transitions.upper_bound ( ext::tie ( symbol, prevStates ) );
    auto lower_bound = transitions.lower_bound ( ext::tie ( symbol, prevStates ) );
    auto iter = std::lower_bound ( lower_bound, upper_bound, next, [ ] ( const auto & transition, const auto & target ) { return transition.second < target; } );
    if ( iter != upper_bound && next >= iter->second )
        return false;
 
    ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > key = ext::make_pair ( std::move ( symbol ), std::move ( prevStates ) );
    transitions.insert ( iter, std::make_pair ( std::move ( key ), std::move ( next ) ) );
    return true;
}
 
template < class SymbolType, class StateType >
bool NFTA < SymbolType, StateType >::removeTransition(const common::ranked_symbol < SymbolType > & symbol, const ext::vector<StateType> & states, const StateType & next) {
    auto upper_bound = transitions.upper_bound ( ext::tie ( symbol, states ) );
    auto lower_bound = transitions.lower_bound ( ext::tie ( symbol, states ) );
    auto iter = std::find_if ( lower_bound, upper_bound, [ & ] ( const auto & transition ) { return transition.second == next; } );
    if ( iter == upper_bound )
        return false;
 
    transitions.erase ( iter );
    return true;
}
 
template < class SymbolType, class StateType >
bool NFTA < SymbolType, StateType >::isDeterministic() const {
    if ( transitions.empty ( ) )
        return true;
 
    for ( auto iter = transitions.begin ( ); std::next ( iter ) != transitions.end ( ); ++ iter )
        if ( iter->first == std::next ( iter )->first )
            return false;
 
    return true;
}
 
} /* namespace automaton */
 
namespace core {
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::NFTA < SymbolType, StateType >, common::ranked_symbol < SymbolType >, automaton::InputAlphabet > {
public:
    static bool used ( const automaton::NFTA < SymbolType, StateType > & automaton, const common::ranked_symbol < SymbolType > & symbol ) {
        for ( const std::pair<const ext::pair<common::ranked_symbol < SymbolType >, ext::vector<StateType> >, StateType > & t : automaton.getTransitions())
            if (t.first.first == symbol)
                return true;
 
        return false;
    }
 
    static bool available ( const automaton::NFTA < SymbolType, StateType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const automaton::NFTA < SymbolType, StateType > &, const common::ranked_symbol < SymbolType > & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::NFTA < SymbolType, StateType >, StateType, automaton::States > {
public:
    static bool used ( const automaton::NFTA < SymbolType, StateType > & automaton, const StateType & state ) {
        if ( automaton.getFinalStates ( ).count ( state ) )
            return true;
 
        for ( const std::pair<const ext::pair<common::ranked_symbol < SymbolType >, ext::vector<StateType> >, StateType >& t : automaton.getTransitions())
            if(ext::contains(t.first.second.begin(), t.first.second.end(), state ) || t . second == state )
                return true;
 
        return false;
    }
 
    static bool available ( const automaton::NFTA < SymbolType, StateType > &, const StateType & ) {
        return true;
    }
 
    static void valid ( const automaton::NFTA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::NFTA < SymbolType, StateType >, StateType, automaton::FinalStates > {
public:
    static bool used ( const automaton::NFTA < SymbolType, StateType > &, const StateType & ) {
        return false;
    }
 
    static bool available ( const automaton::NFTA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).count ( state );
    }
 
    static void valid ( const automaton::NFTA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
struct normalize < automaton::NFTA < SymbolType, StateType > > {
    static automaton::NFTA < > eval ( automaton::NFTA < SymbolType, StateType > && value ) {
        ext::set < common::ranked_symbol < > > alphabet = alphabet::SymbolNormalize::normalizeRankedAlphabet ( std::move ( value ).getInputAlphabet ( ) );
        ext::set < DefaultStateType > states = automaton::AutomatonNormalize::normalizeStates ( std::move ( value ).getStates ( ) );
        ext::set < DefaultStateType > finalStates = automaton::AutomatonNormalize::normalizeStates ( std::move ( value ).getFinalStates ( ) );
 
        automaton::NFTA < > res ( std::move ( states ), std::move ( alphabet ), std::move ( finalStates ) );
 
        for ( std::pair < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > && transition : ext::make_mover ( std::move ( value ).getTransitions ( ) ) ) {
            common::ranked_symbol < DefaultSymbolType > input = alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( transition.first.first ) );
            ext::vector < DefaultStateType > from = automaton::AutomatonNormalize::normalizeStates ( std::move ( transition.first.second ) );
            DefaultStateType to = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.second ) );
 
            res.addTransition ( std::move ( input ), std::move ( from ), std::move ( to ) );
        }
 
        return res;
    }
};
 
} /* namespace core */
 
extern template class automaton::NFTA < >;