// -*- coding: utf-8 -*-
// Copyright (C) by the Spot authors, see the AUTHORS file for details.
//
// 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 <http://www.gnu.org/licenses/>.

#pragma once

#include <spot/misc/common.hh>
#include <spot/twa/fwd.hh>

namespace spot
{
  /// \ingroup twa_algorithms
  /// \brief Sum two twa into a new twa, performing the union of the two input
  /// automata.
  ///
  /// \param left Left term of the sum.
  /// \param right Right term of the sum.
  /// \return A spot::twa_graph containing the sum of \a left and \a right
  SPOT_API
  twa_graph_ptr sum(const const_twa_graph_ptr& left,
                    const const_twa_graph_ptr& right);

  /// \ingroup twa_algorithms
  /// \brief Sum two twa into a new twa, performing the union of the two input
  /// automata.
  ///
  /// \param left Left term of the sum.
  /// \param right Right term of the sum.
  /// \param left_state Initial state of the left term of the sum.
  /// \param right_state Initial state of the right term of the sum.
  /// \return A spot::twa_graph containing the sum of \a left and \a right
  SPOT_API
  twa_graph_ptr sum(const const_twa_graph_ptr& left,
                    const const_twa_graph_ptr& right,
                    unsigned left_state,
                    unsigned right_state);

  /// \ingroup twa_algorithms
  /// \brief Sum two twa into a new twa, using a universal initial transition,
  /// performing the intersection of the two languages of the input automata.
  ///
  /// \param left Left term of the sum.
  /// \param right Right term of the sum.
  /// \return A spot::twa_graph containing the sum of \a left and \a right
  SPOT_API
  twa_graph_ptr sum_and(const const_twa_graph_ptr& left,
                        const const_twa_graph_ptr& right);

  /// \ingroup twa_algorithms
  /// \brief Sum two twa into a new twa, using a universal initial transition,
  /// performing the intersection of the two languages of the input automata.
  ///
  /// \param left Left term of the sum.
  /// \param right Right term of the sum.
  /// \param left_state Initial state of the left term of the sum.
  /// \param right_state Initial state of the right term of the sum.
  /// \return A spot::twa_graph containing the sum of \a left and \a right
  SPOT_API
  twa_graph_ptr sum_and(const const_twa_graph_ptr& left,
                        const const_twa_graph_ptr& right,
                        unsigned left_state,
                        unsigned right_state);
}
