determinize.hh

Go to the documentation of this file.

// This file is part of Awali.
// Copyright 2016-2021 Sylvain Lombardy, Victor Marsault, Jacques Sakarovitch
//
// Awali is a 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.
//
// This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
 
#ifndef AWALI_ALGOS_DETERMINIZE_HH
# define AWALI_ALGOS_DETERMINIZE_HH
 
#include <awali/sttc/algos/determinize/determinize.hxx>
#include <awali/sttc/algos/determinize/is_deterministic.hxx>
#include <awali/common/priority.hh>
 
namespace awali {
  namespace sttc {
    template <typename Aut>
      inline
      auto
      determinize(const Aut& a, bool keep_history = true)
      -> mutable_automaton<context_t_of<Aut>>
    {
      // We use state numbers as indexes, so we need to know the last
      // state number.  If states were removed, it is not the same as
      // the number of states.
      unsigned state_size = a->max_state();
      static const unsigned lim = std::numeric_limits<size_t>::digits;
      if(state_size<lim)
        {
          internal::determinization_bitset_impl<Aut,lim> algo(a);
          auto res=algo();
          if(keep_history)
            algo.set_history();
          return res;
        }
      if(state_size<2*lim)
        {
          internal::determinization_bitset_impl<Aut,2*lim> algo(a);
          auto res=algo();
          if(keep_history)
            algo.set_history();
          return res;
        }
      internal::determinization_set_impl<Aut> algo(a);
      auto res=algo();
      if(keep_history)
        algo.set_history();
      return res;
    }
 
    template <typename Aut>
    inline
    auto
    codeterminize(const Aut& aut, bool keep_history = true)
      -> mutable_automaton<context_t_of<Aut>>
    {
      return transpose(determinize(transpose_view(aut, keep_history)), keep_history);
    }
 
    template <typename Aut>
    inline
    auto
    weighted_determinize(const Aut& aut)
      -> mutable_automaton<context_t_of<Aut>>
    {
      internal::detweighted_algo_impl<Aut> algo(aut);
      auto res = algo();
      return res;
    }
 
    template <class Aut>
    inline bool
    is_sequential(const Aut& aut)
    {
      static_assert(labelset_t_of<Aut>::is_free(),
                    "requires free labelset");
 
      if (1 < aut->num_initials())
        return false;
 
      for (auto s: aut->states())
  if (!internal::is_sequential(aut, s))
    return false;
      return true;
    }
 
    template <class Aut>
    inline bool
    is_deterministic(const Aut& aut)
    {
      static_assert(labelset_t_of<Aut>::is_free(),
        "requires free labelset");
    
      if (1 < aut->num_initials())
  return false;
      for (auto t : aut->initial_transitions())
  if(!aut->weightset()->is_one(aut->weight_of(t)))
    return false;
      for (auto s: aut->states())
  if (!internal::is_deterministic(aut, s))
    return false;
      return true;
    }
  }
}
#endif //AWALI_ALGOS_DETERMINIZE_HH