kambites-helpers.hpp

//
// libsemigroups - C++ library for semigroups and monoids
// Copyright (C) 2024-2025 James D. Mitchell + Maria Tsalakou
//
// This program 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.
//
// 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/>.
//
 
// This file contains the declaration of the Kambites class implementing the
// algorithm described in:
//
// Kambites, M. (2009). Small overlap monoids. I. The word problem. J. Algebra,
// 321(8), 2187–2205.
//
// for solving the word problem in small overlap monoids, and a novel algorithm
// for computing normal forms in small overlap monoids, by Maria Tsalakou.
 
#ifndef LIBSEMIGROUPS_KAMBITES_HELPERS_HPP_
#define LIBSEMIGROUPS_KAMBITES_HELPERS_HPP_
 
#include "cong-common-helpers.hpp"  // for helper declarations in congruence_common namespace
#include "kambites-class.hpp"  // for Kambites
 
#include "detail/kambites-nf.hpp"  // for KambitesNormalFormRange
 
namespace libsemigroups {
 
  namespace congruence_common {
    // Interface helpers - normal_forms

    template <typename Word>
    auto normal_forms(Kambites<Word>& k) {
      k.throw_if_not_C4();
      return detail::KambitesNormalFormRange(k);
    }
  }  // namespace congruence_common


  namespace kambites {
    using congruence_common::add_generating_pair;
    using congruence_common::add_generating_pair_no_checks;

    // Interface helpers - contains
 
    using congruence_common::contains;
    using congruence_common::contains_no_checks;
    using congruence_common::currently_contains;
    using congruence_common::currently_contains_no_checks;

    // Interface helpers - reduce
 
    using congruence_common::reduce;
    using congruence_common::reduce_no_checks;
    using congruence_common::reduce_no_run;
    using congruence_common::reduce_no_run_no_checks;

    // Interface helpers - normal_forms
 
    using congruence_common::normal_forms;

    // Interface helpers - partition
 
    using congruence_common::partition;

    // Interface helpers - non_trivial_classes
 
    using congruence_common::non_trivial_classes;
 
    // There's no non_trivial_classes(Kambites k1, Kambites k2) because it's
    // unclear how this could be computed (because they always define infinite
    // semigroups/monoids), so we can't just do non_trivial_classes(k1,
    // kambites::normal_forms(k2)) (as in ToddCoxeterImpl) because there are
    // infinitely many normal_forms.
 
  }  // namespace kambites
}  // namespace libsemigroups
#endif  // LIBSEMIGROUPS_KAMBITES_HELPERS_HPP_