EpsilonNFTA.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"
#include "NFTA.h"
 
namespace automaton {
 
class InputAlphabet;
class States;
class FinalStates;
 
template < class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType >
class EpsilonNFTA final : public core::Components < EpsilonNFTA < 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::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > transitions;
 
public:
    explicit EpsilonNFTA ( );
 
    explicit EpsilonNFTA ( 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 EpsilonNFTA ( const NFTA < SymbolType, StateType > & other );
 
    /*
     * \brief Creates a new instance of the automaton based on the Deterministic finite tree automaton.
     *
     * \param other the Deterministic finite tree automaton
     */
    explicit EpsilonNFTA ( 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 ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > lhs, StateType rhs );
 
    bool addTransition ( common::ranked_symbol < SymbolType > symbol, ext::vector < StateType > prevStates, StateType next );
 
    bool addTransition ( StateType from, StateType to );
 
    bool removeTransition ( const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > & lhs, const StateType & rhs );
 
    bool removeTransition ( const common::ranked_symbol < SymbolType > & symbol, const ext::vector < StateType > & prevStates, const StateType & next );
 
    bool removeTransition ( const StateType & from, const StateType & to );
 
    const ext::multimap < ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & getTransitions ( ) const & {
        return transitions;
    }
 
    ext::multimap < ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > && getTransitions ( ) && {
        return std::move ( transitions );
    }
 
    ext::multimap < StateType, StateType > getEpsilonTransitions ( ) const;
 
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > getSymbolTransitions ( ) const;
 
    ext::multimap < ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > getTransitionsToState ( const StateType & q ) const {
        ext::multimap < ext::variant < StateType, 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::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > getTransitionsFromState ( const StateType & q ) const {
        ext::multimap < ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > res;
 
        for ( const auto & transition : getTransitions ( ) ) {
            if ( transition.first.template is < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ) ) {
                const ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = transition.first.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
                if ( std::find ( source.second.begin ( ), source.second.end ( ), q ) != source.second.end ( ) ) {
                    res.insert ( transition );
                }
            }
            if ( transition.first.template is < StateType > ( ) ) {
                const StateType & source = transition.first.template get < StateType > ( );
                if ( source == q ) {
                    res.insert ( transition );
                }
            }
        }
 
        return res;
    }
 
    ext::multimap < StateType, StateType > getEpsilonTransitionsFromState ( const StateType & from ) const;
 
    ext::multimap < StateType, StateType > getEpsilonTransitionsToState ( const StateType & to ) const;
 
    bool isEpsilonFree ( ) const;
 
    bool isDeterministic ( ) const;
 
    auto operator <=> ( const EpsilonNFTA & other ) const {
        return std::tie(getStates(), getInputAlphabet(), getFinalStates(), transitions) <=> std::tie(other.getStates(), other.getInputAlphabet(), other.getFinalStates(), other.transitions);
    }
 
    bool operator == ( const EpsilonNFTA & 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 EpsilonNFTA & instance ) {
        return out << "(EpsilonNFTA "
               << " states = " << instance.getStates ( )
               << " inputAlphabet = " << instance.getInputAlphabet ( )
               << " finalStates = " << instance.getFinalStates ( )
               << " transitions = " << instance.getTransitions ( )
               << ")";
    }
};
 
template < class T >
class isEpsilonNFTA_impl : public std::false_type {};
 
template < class SymbolType, class StateType >
class isEpsilonNFTA_impl < EpsilonNFTA < SymbolType, StateType > > : public std::true_type {};
 
template < class T >
constexpr bool isEpsilonNFTA = isEpsilonNFTA_impl < T > { };
 
template < class SymbolType, class StateType >
EpsilonNFTA < SymbolType, StateType >::EpsilonNFTA ( ext::set < StateType > states, ext::set < common::ranked_symbol < SymbolType > > inputAlphabet, ext::set < StateType > finalStates ) : core::Components < EpsilonNFTA, 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 >
EpsilonNFTA < SymbolType, StateType >::EpsilonNFTA() : EpsilonNFTA ( ext::set < StateType > { }, ext::set < common::ranked_symbol < SymbolType > > { }, ext::set < StateType > { } ) {
}
 
template < class SymbolType, class StateType >
EpsilonNFTA < SymbolType, StateType >::EpsilonNFTA(const NFTA < SymbolType, StateType > & other) : EpsilonNFTA ( other.getStates(), other.getInputAlphabet(), other.getFinalStates() ) {
    transitions.insert ( other.getTransitions ( ).begin ( ), other.getTransitions ( ).end ( ) );
}
 
template < class SymbolType, class StateType >
EpsilonNFTA < SymbolType, StateType >::EpsilonNFTA(const DFTA < SymbolType, StateType > & other) : EpsilonNFTA ( other.getStates(), other.getInputAlphabet(), other.getFinalStates() ) {
    transitions.insert ( other.getTransitions ( ).begin ( ), other.getTransitions ( ).end ( ) );
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::addTransition ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > lhs, StateType rhs ) {
    if ( lhs.template is < StateType > ( ) ) {
        const StateType & source = lhs.template get < StateType > ( );
        if ( ! getStates().contains ( source ) )
            throw AutomatonException("State \"" + ext::to_string ( source ) + "\" doesn't exist.");
    } else {
        const ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = lhs.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
        if ( source.second.size ( ) != source.first.getRank ( ) )
            throw AutomatonException("Number of states doesn't match rank of the symbol");
 
        if ( ! getInputAlphabet ( ).contains ( source.first ) )
            throw AutomatonException("Input symbol \"" + ext::to_string ( source.first ) + "\" doesn't exist.");
 
        for ( const StateType & it : source.second ) {
            if ( ! getStates ( ).contains ( it ) )
                throw AutomatonException("State \"" + ext::to_string ( it ) + "\" doesn't exist.");
        }
    }
 
    if ( ! getStates().contains ( rhs ) )
        throw AutomatonException("State \"" + ext::to_string ( rhs ) + "\" doesn't exist.");
 
    auto upper_bound = transitions.upper_bound ( lhs );
    auto lower_bound = transitions.lower_bound ( lhs );
    auto iter = std::lower_bound ( lower_bound, upper_bound, rhs, [ ] ( const auto & transition, const auto & target ) { return transition.second < target; } );
    if ( iter != upper_bound && rhs >= iter->second )
        return false;
 
    transitions.insert ( iter, std::make_pair ( std::move ( lhs ), std::move ( rhs ) ) );
    return true;
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::addTransition ( common::ranked_symbol < SymbolType > symbol, ext::vector<StateType> prevStates, StateType next) {
    return addTransition ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ext::make_pair ( std::move ( symbol ), std::move ( prevStates ) ) ), std::move ( next ) );
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::addTransition ( StateType from, StateType to) {
    return addTransition ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( std::move ( from ) ), std::move ( to ) );
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::removeTransition ( const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > & lhs, const StateType & rhs) {
    auto upper_bound = transitions.upper_bound ( lhs );
    auto lower_bound = transitions.lower_bound ( lhs );
    auto iter = std::find_if ( lower_bound, upper_bound, [ & ] ( const auto & transition ) { return transition.second == rhs; } );
    if ( iter == upper_bound )
        return false;
 
    transitions.erase ( iter );
    return true;
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::removeTransition ( const common::ranked_symbol < SymbolType > & symbol, const ext::vector < StateType > & prevStates, const StateType & next ) {
    return removeTransition ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ext::make_pair ( std::move ( symbol ), std::move ( prevStates ) ) ), std::move ( next ) );
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::removeTransition ( const StateType & from, const StateType & to ) {
    return removeTransition ( ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( std::move ( from ) ), std::move ( to ) );
}
 
template<class SymbolType, class StateType >
ext::multimap < StateType, StateType > EpsilonNFTA < SymbolType, StateType >::getEpsilonTransitions ( ) const {
    ext::multimap < StateType, StateType > result;
 
    for ( const std::pair < const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & transition : transitions )
        if ( transition.first.template is < StateType > ( ) )
            result.insert ( transition.first.template get < StateType > ( ), transition.second );
 
    return result;
}
 
template<class SymbolType, class StateType >
ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > EpsilonNFTA < SymbolType, StateType >::getSymbolTransitions ( ) const {
    ext::multimap < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > >, StateType > result;
 
    for ( const std::pair < const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & transition : transitions ) {
        if ( transition.first.template is < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ) ) {
            const ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = transition.first.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
            result.insert ( source, transition.second );
        }
    }
 
    return result;
}
 
template<class SymbolType, class StateType >
ext::multimap < StateType, StateType > EpsilonNFTA < SymbolType, StateType >::getEpsilonTransitionsFromState ( const StateType & from ) const {
    if ( !getStates ( ).contains ( from ) )
        throw AutomatonException ( "State \"" + ext::to_string ( from ) + "\" doesn't exist" );
 
    ext::multimap < StateType, StateType > res;
    for ( const auto & transition : transitions.equal_range ( from ) )
        res.insert ( from, transition.second );
 
    return res;
}
 
template<class SymbolType, class StateType >
ext::multimap < StateType, StateType > EpsilonNFTA < SymbolType, StateType >::getEpsilonTransitionsToState ( const StateType & to ) const {
    if ( !getStates ( ).contains ( to ) )
        throw AutomatonException ( "State \"" + ext::to_string ( to ) + "\" doesn't exist" );
 
    ext::multimap < StateType, StateType > res;
    for ( const auto & transition : transitions )
        if ( transition.second == to && transition.first.template is < StateType > ( ) )
            res.insert ( transition.first.template get < StateType > ( ), to );
 
    return res;
}
 
template<class SymbolType, class StateType >
bool EpsilonNFTA < SymbolType, StateType >::isEpsilonFree ( ) const {
    for ( const std::pair < const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & transition : transitions )
        if ( transition.first.template is < StateType > ( ) )
            return false;
 
    return true;
}
 
template < class SymbolType, class StateType >
bool EpsilonNFTA < 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 isEpsilonFree ( );
}
 
} /* namespace automaton */
 
namespace core {
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::EpsilonNFTA < SymbolType, StateType >, common::ranked_symbol < SymbolType >, automaton::InputAlphabet > {
public:
    static bool used ( const automaton::EpsilonNFTA < SymbolType, StateType > & automaton, const common::ranked_symbol < SymbolType > & symbol ) {
        for ( const std::pair < const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & t : automaton.getTransitions())
            if ( t.first.template is < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ) ) {
                const ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = t.first.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
                if ( source.first == symbol)
                    return true;
            }
 
        return false;
    }
 
    static bool available ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const common::ranked_symbol < SymbolType > & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::EpsilonNFTA < SymbolType, StateType >, StateType, automaton::States > {
public:
    static bool used ( const automaton::EpsilonNFTA < SymbolType, StateType > & automaton, const StateType & state ) {
        if ( automaton.getFinalStates ( ).contains ( state ) )
            return true;
 
        for ( const std::pair < const ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > & t : automaton.getTransitions ( ) ) {
            if ( t.first.template is < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( ) ) {
                const ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = t.first.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
                if ( ext::contains ( source.second.begin ( ), source.second.end ( ), state ) ) {
                    return true;
                }
            }
            if ( t.first.template is < StateType > ( ) ) {
                if ( t.first.template get < StateType > ( ) == state ) {
                    return true;
                }
            }
            if ( t . second == state ) {
                return true;
            }
        }
 
        return false;
    }
 
    static bool available ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const StateType & ) {
        return true;
    }
 
    static void valid ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::EpsilonNFTA < SymbolType, StateType >, StateType, automaton::FinalStates > {
public:
    static bool used ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const StateType & ) {
        return false;
    }
 
    static bool available ( const automaton::EpsilonNFTA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).contains ( state );
    }
 
    static void valid ( const automaton::EpsilonNFTA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
struct normalize < automaton::EpsilonNFTA < SymbolType, StateType > > {
    static automaton::EpsilonNFTA < > eval ( automaton::EpsilonNFTA < 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::EpsilonNFTA < > res ( std::move ( states ), std::move ( alphabet ), std::move ( finalStates ) );
 
        for ( std::pair < ext::variant < StateType, ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > >, StateType > && transition : ext::make_mover ( std::move ( value ).getTransitions ( ) ) ) {
            DefaultStateType to = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.second ) );
            if ( transition.first.template is < StateType > ( ) ) {
                DefaultStateType from = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.first.template get < StateType > ( ) ) );
                res.addTransition ( from, to );
            } else {
                ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > & source = transition.first.template get < ext::pair < common::ranked_symbol < SymbolType >, ext::vector < StateType > > > ( );
 
                common::ranked_symbol < DefaultSymbolType > input = alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( source.first ) );
                ext::vector < DefaultStateType > from = automaton::AutomatonNormalize::normalizeStates ( std::move ( source.second ) );
 
                res.addTransition ( std::move ( input ), std::move ( from ), std::move ( to ) );
            }
        }
 
        return res;
    }
};
 
} /* namespace core */
 
extern template class automaton::EpsilonNFTA < >;