CompactDFA.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/map>
#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 <automaton/AutomatonException.h>
 
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
#include <automaton/common/AutomatonNormalize.h>
 
#include "DFA.h"
 
namespace automaton {
 
class InputAlphabet;
class States;
class FinalStates;
class InitialState;
 
template < class SymbolTypeT = DefaultSymbolType, class StateTypeT = DefaultStateType >
class CompactDFA final : public core::Components < CompactDFA < 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::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > transitions;
 
public:
    explicit CompactDFA ( StateType initialState );
 
    explicit CompactDFA ( 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 Deterministic finite automaton.
     *
     * \param other the Deterministic finite automaton
     */
    explicit CompactDFA ( 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, ext::vector < SymbolType > input, StateType to );
 
    bool removeTransition ( const StateType & from, const ext::vector < SymbolType > & input, const StateType & to );
 
    const ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > & getTransitions ( ) const &;
 
    ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > && getTransitions ( ) &&;
 
    ext::iterator_range < typename ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType >::const_iterator > getTransitionsFromState ( const StateType & from ) const;
 
    ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > getTransitionsToState ( const StateType & to ) const;
 
    auto operator <=> ( const CompactDFA & 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 CompactDFA & 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 CompactDFA & instance ) {
        return out << "(CompactDFA"
               << " states = " << instance.getStates ( )
               << " inputAlphabet = " << instance.getInputAlphabet ( )
               << " initialState = " << instance.getInitialState ( )
               << " finalStates = " << instance.getFinalStates ( )
               << " transitions = " << instance.getTransitions ( )
               << ")";
    }
};
 
template < class T >
class isCompactDFA_impl : public std::false_type {};
 
template < class SymbolType, class StateType >
class isCompactDFA_impl < CompactDFA < SymbolType, StateType > > : public std::true_type {};
 
template < class T >
constexpr bool isCompactDFA = isCompactDFA_impl < T > { };
 
template < class SymbolType, class StateType >
CompactDFA < SymbolType, StateType >::CompactDFA ( ext::set < StateType > states, ext::set < SymbolType > inputAlphabet, StateType initialState, ext::set < StateType > finalStates ) : core::Components < CompactDFA, 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 >
CompactDFA < SymbolType, StateType >::CompactDFA ( StateType initialState ) : CompactDFA ( ext::set < StateType > { initialState }, ext::set < SymbolType > { }, initialState, ext::set < StateType > { } ) {
}
 
template < class SymbolType, class StateType >
CompactDFA < SymbolType, StateType >::CompactDFA ( const DFA < SymbolType, StateType > & other ) : CompactDFA ( other.getStates ( ), other.getInputAlphabet ( ), other.getInitialState ( ), other.getFinalStates ( ) ) {
    for ( const auto & transition : other.getTransitions ( ) )
        transitions.insert ( ext::make_pair ( transition.first.first, ext::vector < SymbolType > { transition.first.second } ), transition.second );
}
 
template < class SymbolType, class StateType >
bool CompactDFA < SymbolType, StateType >::addTransition ( StateType from, ext::vector < SymbolType > input, StateType to ) {
    if ( ! getStates ( ).contains ( from ) )
        throw AutomatonException ( "State \"" + ext::to_string ( from ) + "\" doesn't exist." );
 
    ext::set < SymbolType > inputStringAlphabet ( input.begin ( ), input.end ( ) );
 
     // Transition regexp's alphabet must be subset of automaton's alphabet
    if ( ! std::includes ( getInputAlphabet ( ).begin ( ), getInputAlphabet ( ).end ( ), inputStringAlphabet.begin ( ), inputStringAlphabet.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." );
 
    ext::pair < StateType, ext::vector < SymbolType > > key = ext::make_pair ( std::move ( from ), std::move ( input ) );
    if ( transitions.find ( key ) != transitions.end ( ) )
        return false;
 
    auto transitionsFromState = getTransitionsFromState ( key.first );
    if ( key.second.empty ( ) && ! transitionsFromState.empty ( ) )
        throw AutomatonException ( "Epsilon transition from state \"" + ext::to_string ( key.first ) + "\" coflicts already existent transitions." );
 
    for ( const std::pair < const ext::pair < StateType, ext::vector < SymbolType > >, StateType > & transition : getTransitionsFromState ( key.first ) )
        if ( transition.first.second.empty ( ) || transition.first.second [ 0 ] == key.second [ 0 ] )
            throw AutomatonException ( "Transition from state \"" + ext::to_string ( key.first ) + "\" reading symbol \"" + ext::to_string ( key.second ) + "\" already exists. Targeto state was \"" + ext::to_string ( to ) + "\"." );
 
    transitions.insert ( std::move ( key ), std::move ( to ) );
    return true;
}
 
template < class SymbolType, class StateType >
bool CompactDFA < SymbolType, StateType >::removeTransition ( const StateType & from, const ext::vector < SymbolType > & input, const StateType & to ) {
    ext::pair < StateType, ext::vector < SymbolType > > key = ext::make_pair ( from, input );
 
    auto iter = transitions.find ( key );
 
    if ( iter == transitions.end ( ) )
        return false;
 
    if ( iter->second != to )
        return false;
 
    transitions.erase ( iter );
    return true;
}
 
template < class SymbolType, class StateType >
const ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > & CompactDFA < SymbolType, StateType >::getTransitions ( ) const & {
    return transitions;
}
 
template < class SymbolType, class StateType >
ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > && CompactDFA < SymbolType, StateType >::getTransitions ( ) && {
    return std::move ( transitions );
}
 
template<class SymbolType, class StateType >
ext::iterator_range < typename ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType >::const_iterator > CompactDFA < SymbolType, StateType >::getTransitionsFromState ( const StateType & from ) const {
    if ( ! getStates ( ).contains ( from ) )
        throw AutomatonException ( "State \"" + ext::to_string ( from ) + "\" doesn't exist" );
 
    auto lower = transitions.lower_bound ( ext::slice_comp ( from ) );
    auto upper = transitions.upper_bound ( ext::slice_comp ( from ) );
 
    return ext::make_iterator_range ( lower, upper );
}
 
template < class SymbolType, class StateType >
ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > CompactDFA < SymbolType, StateType >::getTransitionsToState ( const StateType & to ) const {
    if ( ! getStates ( ).contains ( to ) )
        throw AutomatonException ( "State \"" + ext::to_string ( to ) + "\" doesn't exist" );
 
    ext::map < ext::pair < StateType, ext::vector < SymbolType > >, StateType > transitionsToState;
 
    for ( const std::pair < const ext::pair < StateType, ext::vector < 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::CompactDFA < SymbolType, StateType >, SymbolType, automaton::InputAlphabet > {
public:
    static bool used ( const automaton::CompactDFA < SymbolType, StateType > & automaton, const SymbolType & symbol ) {
        for ( const std::pair < const ext::pair < StateType, ext::vector < SymbolType > >, StateType > & transition : automaton.getTransitions ( ) ) {
            ext::set < SymbolType > alphabet ( transition.first.second.begin ( ), transition.first.second.end ( ) );
            if ( alphabet.contains ( symbol ) )
                return true;
        }
 
        return false;
    }
 
    static bool available ( const automaton::CompactDFA < SymbolType, StateType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const automaton::CompactDFA < SymbolType, StateType > &, const SymbolType & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::CompactDFA < SymbolType, StateType >, StateType, automaton::States > {
public:
    static bool used ( const automaton::CompactDFA < 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, ext::vector < SymbolType > >, StateType > & t : automaton.getTransitions ( ) )
            if ( ( t.first.first == state ) || t.second == state )
                return true;
 
        return false;
    }
 
    static bool available ( const automaton::CompactDFA < SymbolType, StateType > &, const StateType & ) {
        return true;
    }
 
    static void valid ( const automaton::CompactDFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
class SetConstraint< automaton::CompactDFA < SymbolType, StateType >, StateType, automaton::FinalStates > {
public:
    static bool used ( const automaton::CompactDFA < SymbolType, StateType > &, const StateType & ) {
        return false;
    }
 
    static bool available ( const automaton::CompactDFA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).contains ( state );
    }
 
    static void valid ( const automaton::CompactDFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
class ElementConstraint< automaton::CompactDFA < SymbolType, StateType >, StateType, automaton::InitialState > {
public:
    static bool available ( const automaton::CompactDFA < SymbolType, StateType > & automaton, const StateType & state ) {
        return automaton.template accessComponent < automaton::States > ( ).get ( ).contains ( state );
    }
 
    static void valid ( const automaton::CompactDFA < SymbolType, StateType > &, const StateType & ) {
    }
};
 
template < class SymbolType, class StateType >
struct normalize < automaton::CompactDFA < SymbolType, StateType > > {
    static automaton::CompactDFA < > eval ( automaton::CompactDFA < 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::CompactDFA < > res ( std::move ( states ), std::move ( alphabet ), std::move ( initialState ), std::move ( finalStates ) );
 
        for ( std::pair < ext::pair < StateType, ext::vector < SymbolType > >, StateType > && transition : ext::make_mover ( std::move ( value ).getTransitions ( ) ) ) {
            DefaultStateType from = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.first.first ) );
            ext::vector < DefaultSymbolType > input = alphabet::SymbolNormalize::normalizeSymbols ( std::move ( transition.first.second ) );
            DefaultStateType target = automaton::AutomatonNormalize::normalizeState ( std::move ( transition.second ) );
 
            res.addTransition ( std::move ( from ), std::move ( input ), target );
        }
 
        return res;
    }
};
 
} /* namespace core */
 
extern template class automaton::CompactDFA < >;