AllEpsilonClosure.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 <alib/set>
#include <alib/map>
#include <alib/deque>
 
#include <automaton/FSM/ExtendedNFA.h>
#include <automaton/FSM/CompactNFA.h>
#include <automaton/FSM/EpsilonNFA.h>
#include <automaton/FSM/MultiInitialStateNFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
 
#include <automaton/TA/NondeterministicZAutomaton.h>
#include <automaton/TA/EpsilonNFTA.h>
 
#include <regexp/properties/RegExpEpsilon.h>
 
namespace automaton {
 
namespace properties {
 
class AllEpsilonClosure {
public:
    template < class T >
    requires isEpsilonNFA < T > || isEpsilonNFTA < T >
    static ext::map < typename T::StateType, ext::set < typename T::StateType > > allEpsilonClosure( const T & fsm);
 
    template < class T >
    requires isDFA < T > || isNFA < T > || isMultiInitialStateNFA < T >
    static ext::map < typename T::StateType, ext::set < typename T::StateType > > allEpsilonClosure ( const T & fsm );
 
    template < class SymbolType, class StateType >
    static ext::map < StateType, ext::set < StateType > > allEpsilonClosure( const automaton::ExtendedNFA < SymbolType, StateType > & fsm);
 
    template < class SymbolType, class StateType >
    static ext::map < StateType, ext::set < StateType > > allEpsilonClosure( const automaton::CompactNFA < SymbolType, StateType > & fsm);
 
    template < class SymbolType, class StateType >
    static ext::map < StateType, ext::set < StateType > > allEpsilonClosure( const automaton::NondeterministicZAutomaton < SymbolType, StateType > & fsm);
};
 
template < class T >
requires isEpsilonNFA < T > || isEpsilonNFTA < T >
ext::map < typename T::StateType, ext::set < typename T::StateType > > AllEpsilonClosure::allEpsilonClosure( const T & fsm) {
    ext::deque < ext::map < typename T::StateType, ext::set < typename T::StateType > > > Qi;
 
    Qi.push_back ( { } );
    for ( const typename T::StateType & state : fsm.getStates ( ) )
        Qi.at ( 0 ) [ state ].insert ( state );
 
    int i = 1;
    while ( true ) {
        Qi.push_back ( Qi.at ( i - 1 ) );
 
        for ( const std::pair < const typename T::StateType, ext::set < typename T::StateType > > & p : Qi.at( i - 1 ) )
            for ( const typename T::StateType & pclosure : p.second )
                for ( const auto & transition : fsm.getEpsilonTransitionsFromState ( pclosure ) )
                    Qi.at ( i ) [ p.first ].insert ( transition.second );
 
        if ( Qi.at ( i ) == Qi.at ( i - 1 ) )
            break;
 
        i = i + 1;
    }
 
    return Qi.at ( i );
}
 
template < class T >
requires isDFA < T > || isNFA < T > || isMultiInitialStateNFA < T >
ext::map < typename T::StateType, ext::set < typename T::StateType > > AllEpsilonClosure::allEpsilonClosure ( const T & fsm ) {
    ext::map < typename T::StateType, ext::set < typename T::StateType > > closure;
    for ( const typename T::StateType & state : fsm.getStates ( ) )
        closure [ state ].insert ( state );
    return closure;
}
 
template < class SymbolType, class StateType >
ext::map < StateType, ext::set < StateType > > AllEpsilonClosure::allEpsilonClosure( const automaton::ExtendedNFA < SymbolType, StateType > & fsm) {
    ext::map<StateType, ext::set<StateType>> res;
    ext::map<StateType, ext::set<StateType>> step;
 
    for(const std::pair<const ext::pair<StateType, regexp::UnboundedRegExpStructure < SymbolType > >, StateType >& transition : fsm.getTransitions() )
        if( regexp::properties::RegExpEpsilon::languageContainsEpsilon( transition.first.second ) )
            step[transition.first.first].insert(transition.second);
 
    for(const StateType& state : fsm.getStates())
        step[state].insert(state);
 
    do {
        res = step;
 
        for(const std::pair<const StateType, ext::set<StateType>>& item : res)
            for(const StateType& to : item.second)
                step[item.first].insert(res[to].begin(), res[to].end());
    } while(res != step);
 
    return res;
}
 
template < class SymbolType, class StateType >
ext::map < StateType, ext::set < StateType > > AllEpsilonClosure::allEpsilonClosure( const automaton::CompactNFA < SymbolType, StateType > & fsm) {
    ext::map<StateType, ext::set<StateType>> res;
    ext::map<StateType, ext::set<StateType>> step;
 
    for(const std::pair<const ext::pair<StateType, ext::vector < SymbolType > >, StateType >& transition : fsm.getTransitions() )
        if( transition.first.second.empty ( ) )
            step[transition.first.first].insert(transition.second);
 
    for(const StateType& state : fsm.getStates())
        step[state].insert(state);
 
    do {
        res = step;
 
        for(const std::pair<const StateType, ext::set<StateType>>& item : res)
            for(const StateType& to : item.second)
                step[item.first].insert(res[to].begin(), res[to].end());
    } while(res != step);
 
    return res;
}
 
template < class SymbolType, class StateType >
ext::map < StateType, ext::set < StateType > > AllEpsilonClosure::allEpsilonClosure( const automaton::NondeterministicZAutomaton < SymbolType, StateType > & fsm) {
    ext::map<StateType, ext::set<StateType>> res;
    ext::map<StateType, ext::set<StateType>> step;
 
    for ( const std::pair < const ext::pair < ext::variant < SymbolType, StateType >, ext::vector < ext::variant < SymbolType, StateType > > >, StateType > & transition : fsm.getTransitions ( ) )
        if ( fsm.getStates ( ).contains ( transition.first.first ) && transition.first.second.empty ( ) )
            step [ transition.first.first.template get < StateType > ( ) ].insert ( transition.second );
 
    for(const StateType& state : fsm.getStates())
        step[state].insert(state);
 
    do {
        res = step;
 
        for(const std::pair<const StateType, ext::set<StateType>>& item : res)
            for(const StateType& to : item.second)
                step[item.first].insert(res[to].begin(), res[to].end());
    } while(res != step);
 
    return res;
}
 
} /* namespace properties */
 
} /* namespace automaton */