// -*- coding: utf-8 -*-
// Copyright (C) 2017, 2019 Laboratoire de Recherche et Développement de
// l'Epita (LRDE).
//
// This file is part of Spot, a model checking library.
//
// Spot 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.
//
// Spot 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 .
#pragma once
#include
namespace spot
{
/// \brief Convert an alternating automaton to a weak alternating automaton.
///
/// The input automaton must have a generalized co-Büchi or Büchi acceptance
/// condition.
/// The automaton will be converted into a weak Büchi automaton. If the input
/// automaton is already weak, it will simply be copied.
///
/// For details about the algorithm used, see the following papers:
/// \cite kupferman.01.tocl ,
/// \cite kupferman.05.tcs .
///
/// Although at the end of the above paper there is a hint at an optimization
/// that greatly reduces the number of transition in the resulting automaton,
/// but in return makes the run of remove_alternation algorithm way slower.
/// Hence, the optimization is disabled by default.
///
/// \param aut the automaton to convert to weak
/// \param less whether to activate the optimization on the number of
/// transitions or not, disabled by default
SPOT_API
twa_graph_ptr to_weak_alternating(const_twa_graph_ptr& aut,
bool less = false);
}