25#ifndef LIBSEMIGROUPS_PRESENTATION_HPP_
26#define LIBSEMIGROUPS_PRESENTATION_HPP_
31#include <initializer_list>
39#include <unordered_map>
40#include <unordered_set>
44#include "adapters.hpp"
45#include "constants.hpp"
51#include "word-range.hpp"
53#include "detail/fmt.hpp"
54#include "detail/print.hpp"
55#include "detail/string.hpp"
56#include "detail/uf.hpp"
101 template <
typename Word>
123 bool _contains_empty_word;
284 LIBSEMIGROUPS_ASSERT(i < _alphabet.size());
317 return _alphabet_map.find(val)->second;
346 return _alphabet_map.find(val) != _alphabet_map.cend();
384 template <
typename Iterator1,
typename Iterator2>
389 rules.emplace_back(lhs_begin, lhs_end);
390 rules.emplace_back(rhs_begin, rhs_end);
408 template <
typename Iterator1,
typename Iterator2>
504 return _contains_empty_word;
527 _contains_empty_word = val;
541 decltype(_alphabet_map) alphabet_map;
571 template <
typename Iterator1,
typename Iterator2>
609 void try_set_alphabet(
decltype(_alphabet_map)& alphabet_map,
612 decltype(_alphabet_map)& alphabet_map)
const;
623 template <
typename Word>
634 template <
typename Word>
661 template <
typename Iterator>
665 "expected even number of words in \"rules\", found {}",
681 template <
typename Word>
704 template <
typename Word>
706 std::string_view arg =
"1st");
721 template <
typename Word>
742 template <
typename Word,
typename Iterator>
747 for (
auto it = first; it != last; ++it) {
774 template <
typename Word>
801 template <
typename Word>
820 template <
typename Word>
840 template <
typename Word>
842 p.
add_rule(lhop.begin(), lhop.end(), rhop.begin(), rhop.end());
968 template <
typename Word,
typename Letter>
988 template <
typename Word,
typename Letter>
1013 template <
typename Word,
typename Iterator>
1015 for (
auto it = first; it != last; it += 2) {
1037 template <
typename Word,
typename Iterator>
1041 for (
auto it = first; it != last; it += 2) {
1061 template <
typename Word>
1083 template <
typename Word>
1105 template <
typename Word>
1124 template <
typename Word>
1142 template <
typename Word>
1169 template <
typename Word>
1216 template <
typename Word>
1231 template <
typename Word>
1254 template <
typename Word>
1269 template <
typename Word>
1287 template <
typename Word,
typename Compare>
1304 template <
typename Word,
typename Compare>
1316 template <
typename Word>
1338 template <
typename Word,
typename Compare>
1355 template <
typename Word>
1377 template <
typename Word>
1395 template <
typename Word,
typename Iterator>
1418 template <
typename Word>
1455 template <
typename Word>
1457 Word
const& existing,
1458 Word
const& replacement);
1483 template <
typename Word,
typename Iterator1,
typename Iterator2>
1485 Iterator1 first_existing,
1486 Iterator1 last_existing,
1487 Iterator2 first_replacement,
1488 Iterator2 last_replacement);
1503 char const* existing,
1504 char const* replacement) {
1528 template <
typename Word>
1530 Word
const& existing,
1531 Word
const& replacement);
1549 template <
typename Iterator>
1550 size_t length(Iterator first, Iterator last);
1563 template <
typename Word>
1577 template <
typename Word>
1579 for (
auto& rule : p.
rules) {
1599 template <
typename Word>
1601 for (
auto& rule : p.rules) {
1621 template <
typename Word>
1637 template <
typename Word>
1652 char const* new_alphabet) {
1673 template <
typename Iterator>
1691 template <
typename Word>
1714 template <
typename Iterator>
1732 template <
typename Word>
1752 template <
typename Iterator>
1769 template <
typename Word>
1788 template <
typename Iterator>
1789 typename Iterator::value_type::size_type
1805 template <
typename Word>
1824 template <
typename Word>
1842 template <
typename Word>
1862 template <
typename Word>
1882 template <
typename Word>
1907 template <
typename Word>
1933 template <
typename Word>
1956 template <
typename Word>
1987 template <
typename Word>
2005 template <
typename Word>
2007 Word
const& letters) {
2008 for (
auto x : letters) {
2028 template <
typename Word>
2031 for (
auto x : letters) {
2052 template <
typename Word>
2054 Word
const& letters1,
2055 Word
const& letters2);
2072 template <
typename Word>
2074 Word
const& letters) {
2094 template <
typename Word>
2096 Word
const& letters,
2126 template <
typename Word1,
typename Word2>
2128 Word2
const& letters,
2129 Word2
const& inverses);
2137 template <
typename Word>
2139 Word
const& letters,
2140 Word
const& inverses) {
2151 char const* letters,
2152 char const* inverses) {
2154 p, std::string_view(letters), std::string_view(inverses));
2164 std::string_view letters,
2165 std::string_view inverses) {
2197 template <
typename Word1,
typename Word2>
2199 Word2
const& relator);
2208 template <
typename Word>
2210 Word
const& relator) {
2221 char const* relator) {
2223 p, std::string_view(relator));
2246 template <
typename Word1,
typename Word2>
2256 template <
typename Word>
2268 char const* relator) {
2270 p, std::string_view(relator));
2316 template <
typename Word>
2474 template <
typename Word>
2499 template <
typename Word>
2524 template <
typename Word>
2527 return !(lhop == rhop);
2548 template <
typename Word>
2551 return !(lhop == rhop);
2565 template <
typename Word>
2579 template <
typename Word>
2583 template <
typename T>
2586 template <
typename T>
2589 template <
typename T>
2590 struct IsPresentationHelper<InversePresentation<T>> : std::true_type {};
2592 template <
typename T>
2593 struct IsInversePresentationHelper : std::false_type {};
2595 template <
typename T>
2596 struct IsInversePresentationHelper<InversePresentation<T>>
2597 : std::true_type {};
2599 class GreedyReduceHelper {
2603 std::vector<size_t> _distance_from_root;
2604 std::vector<size_t> _num_leafs;
2605 std::vector<size_t> _scratch;
2606 std::vector<size_t> _suffix_index;
2611 explicit GreedyReduceHelper(Ukkonen
const& u);
2613 GreedyReduceHelper() =
delete;
2614 GreedyReduceHelper(GreedyReduceHelper
const&) =
delete;
2615 GreedyReduceHelper(GreedyReduceHelper&&) =
delete;
2616 GreedyReduceHelper& operator=(GreedyReduceHelper
const&) =
delete;
2617 GreedyReduceHelper& operator=(GreedyReduceHelper&&) =
delete;
2618 ~GreedyReduceHelper();
2620 void pre_order(Ukkonen
const& u,
size_t v);
2621 void post_order(Ukkonen
const& u,
size_t v);
2622 std::pair<const_iterator, const_iterator> yield(Ukkonen
const& u);
2636 template <
typename T>
2638 = detail::IsInversePresentationHelper<T>::value;
2650 template <
typename T>
2655#include "presentation.tpp"
For an implementation of inverse presentations for semigroups or monoids.
Definition presentation.hpp:2317
typename Presentation< Word >::size_type size_type
Size type for rules.
Definition presentation.hpp:2334
typename Presentation< Word >::letter_type letter_type
Type of the letters in the words that constitute the rules of an InversePresentation object.
Definition presentation.hpp:2325
void throw_if_bad_alphabet_rules_or_inverses() const
Check if the InversePresentation is valid.
Definition presentation.hpp:2448
typename Presentation< Word >::iterator iterator
Type of an iterator to either side of a rule.
Definition presentation.hpp:2331
InversePresentation(Presentation< Word > const &p)
Construct an InversePresentation from a Presentation reference.
Definition presentation.hpp:2351
typename Presentation< Word >::word_type word_type
Type of the words in the rules of an InversePresentation object.
Definition presentation.hpp:2321
letter_type inverse(letter_type x) const
Return the inverse of a letter in the alphabet.
InversePresentation & inverses(word_type const &w)
Set the inverse of each letter in the alphabet.
Definition presentation.hpp:2403
InversePresentation(Presentation< Word > &&p)
Construct an InversePresentation from a Presentation rvalue reference.
Definition presentation.hpp:2362
word_type const & inverses() const noexcept
Return the inverse of each letter in the alphabet.
Definition presentation.hpp:2417
InversePresentation & inverses_no_checks(word_type const &w)
Set the inverse of each letter in the alphabet.
typename Presentation< Word >::const_iterator const_iterator
Type of a const iterator to either side of a rule.
Definition presentation.hpp:2328
For an implementation of presentations for semigroups or monoids.
Definition presentation.hpp:102
letter_type add_generator()
Add a generator.
Presentation & remove_generator(letter_type x)
Remove x as a generator.
Presentation & alphabet(word_type &&lphbt)
Set the alphabet from rvalue reference.
void throw_if_bad_alphabet_or_rules() const
Check if the alphabet and rules are valid.
Definition presentation.hpp:603
void throw_if_bad_rules() const
Check if every word in every rule consists only of letters belonging to the alphabet.
Presentation & add_generator_no_checks(letter_type x)
Add x as a generator.
Presentation & add_generator(letter_type x)
Add x as a generator.
Presentation & contains_empty_word(bool val) noexcept
Set whether whether the empty word is a valid relation word.
Definition presentation.hpp:526
typename std::vector< word_type >::size_type size_type
Size type for rules.
Definition presentation.hpp:118
void throw_if_letter_not_in_alphabet(letter_type c) const
Check if a letter belongs to the alphabet or not.
size_type index_no_checks(letter_type val) const
Return the index of a letter in the alphabet.
Definition presentation.hpp:316
Presentation & alphabet(size_type n)
Set the alphabet by size.
Presentation & alphabet_from_rules()
Set the alphabet to be the letters in the rules.
Presentation & operator=(Presentation &&)
Default move assignment operator.
Presentation & add_rule_no_checks(Iterator1 lhs_begin, Iterator1 lhs_end, Iterator2 rhs_begin, Iterator2 rhs_end)
Add a rule to the presentation.
Definition presentation.hpp:385
typename std::vector< word_type >::iterator iterator
Type of an iterator to either side of a rule.
Definition presentation.hpp:115
Presentation(Presentation const &)
Default copy constructor.
void throw_if_alphabet_has_duplicates() const
Check if the alphabet is valid.
Definition presentation.hpp:540
letter_type letter_no_checks(size_type i) const
Return a letter in the alphabet by index.
Definition presentation.hpp:283
void throw_if_letter_not_in_alphabet(Iterator1 first, Iterator2 last) const
Check if every letter in a range belongs to the alphabet.
Presentation(Presentation &&)
Default move constructor.
letter_type letter(size_type i) const
Return a letter in the alphabet by index.
std::vector< word_type > rules
Data member holding the rules of the presentation.
Definition presentation.hpp:131
Presentation & operator=(Presentation const &)
Default copy assignment operator.
bool contains_empty_word() const noexcept
Return whether the empty word is a valid relation word.
Definition presentation.hpp:503
Presentation & alphabet(word_type const &lphbt)
Set the alphabet const reference.
size_type index(letter_type val) const
Return the index of a letter in the alphabet.
Presentation & init()
Remove the alphabet and all rules.
word_type const & alphabet() const noexcept
Return the alphabet of the presentation.
Definition presentation.hpp:183
Word word_type
Type of the words in the rules of a Presentation object.
Definition presentation.hpp:105
typename word_type::value_type letter_type
Type of the letters in the words that constitute the rules of a Presentation object.
Definition presentation.hpp:109
Presentation & remove_generator_no_checks(letter_type x)
Remove x as a generator.
Presentation()
Default constructor.
typename std::vector< word_type >::const_iterator const_iterator
Type of a const iterator to either side of a rule.
Definition presentation.hpp:112
Presentation & add_rule(Iterator1 lhs_begin, Iterator1 lhs_end, Iterator2 rhs_begin, Iterator2 rhs_end)
Add a rule to the presentation and check it is valid.
Definition presentation.hpp:409
bool in_alphabet(letter_type val) const
Check if a letter belongs to the alphabet or not.
Definition presentation.hpp:345
typename word_type::const_iterator const_iterator
Alias for word_type iterators.
Definition ukkonen.hpp:106
std::string to_human_readable_repr(AhoCorasick const &ac)
Return a string representation.
bool operator!=(Bipartition const &x, Bipartition const &y)
Check bipartitions for inequality.
Definition bipart.hpp:1637
Undefined const UNDEFINED
Value for something undefined.
#define LIBSEMIGROUPS_EXCEPTION(...)
Throw a LibsemigroupsException.
Definition exception.hpp:99
Presentation(Presentation< Word > const &) -> Presentation< Word >
Deduction guide.
bool operator==(Presentation< Word > const &lhop, Presentation< Word > const &rhop)
Compare for equality.
Definition presentation.hpp:2475
static constexpr bool IsPresentation
Helper variable template.
Definition presentation.hpp:2651
static constexpr bool IsInversePresentation
Helper variable template.
Definition presentation.hpp:2638
std::vector< letter_type > word_type
Type for a word over the generators of a semigroup.
Definition types.hpp:99
Namespace for Presentation helper functions.
Definition obvinf.hpp:60
Iterator::value_type::size_type longest_rule_length(Iterator first, Iterator last)
Return the maximum length of a rule in the given range.
void add_commutes_rules_no_checks(Presentation< Word > &p, Word const &letters1, Word const &letters2)
Add rules so specific letters commute.
Presentation< Word >::letter_type replace_word_with_new_generator(Presentation< Word > &p, Iterator first, Iterator last)
Replace non-overlapping instances of a subword via iterators.
bool reduce_to_2_generators(Presentation< Word > &p, size_t index=0)
Reduce the number of generators in a -relation presentation to 2.
void add_idempotent_rules_no_checks(Presentation< Word > &p, Word const &letters)
Add rules that define each letter as an idempotent.
Definition presentation.hpp:2006
void throw_if_bad_inverses(Presentation< Word > const &p, Word const &vals)
throw_if_bad_alphabet_or_rules if vals act as semigroup inverses in p.
Iterator longest_rule(Iterator first, Iterator last)
Return an iterator pointing at the left-hand side of the first rule of maximal length in the given ra...
void add_involution_rules_no_checks(Presentation< Word > &p, word_type const &letters)
Add rules that define involution.
Definition presentation.hpp:2029
void throw_if_odd_number_of_rules(Iterator first, Iterator last)
Throw if the distance between iterators is not even.
Definition presentation.hpp:662
void reverse(Presentation< Word > &p)
Reverse every rule.
Definition presentation.hpp:1578
bool contains_rule(Presentation< Word > &p, Word const &lhs, Word const &rhs)
Check if a presentation contains a rule.
void greedy_reduce_length_and_number_of_gens(Presentation< Word > &p)
Greedily reduce the length and number of generators of the presentation.
Word longest_subword_reducing_length(Presentation< Word > &p)
Return the longest common subword of the rules.
bool sort_each_rule(Presentation< Word > &p)
Sort the left-hand and right-hand side of each rule by shortlex.
bool are_rules_sorted(Presentation< Word > const &p, Compare cmp)
Check the rules are sorted relative to cmp .
void add_rules(Presentation< Word > &p, Iterator first, Iterator last)
Add the rules stored in the range [first, last).
Definition presentation.hpp:1014
Iterator shortest_rule(Iterator first, Iterator last)
Return an iterator pointing at the left-hand side of the first rule of minimal length in the given ra...
void balance_no_checks(Presentation< Word1 > &p, Word2 const &letters, Word2 const &inverses)
Balance the length of the left-hand and right-hand sides.
Iterator::value_type::size_type shortest_rule_length(Iterator first, Iterator last)
Return the minimum length of a rule in the given range.
void remove_trivial_rules(Presentation< Word > &p)
Remove rules consisting of identical words.
void add_rules_no_checks(Presentation< Word > &p, Iterator first, Iterator last)
Add the rules stored in the range [first, last).
Definition presentation.hpp:1038
void replace_word(Presentation< Word > &p, Word const &existing, Word const &replacement)
Replace instances of a word on either side of a rule by another word.
void add_rule_no_checks(Presentation< Word > &p, Word const &lhop, Word const &rhop)
Add a rule to the presentation by reference.
Definition presentation.hpp:821
void throw_if_bad_rules(Presentation< Word > const &p, Iterator first, Iterator last)
Check rules against the alphabet of p.
Definition presentation.hpp:743
void sort_rules(Presentation< Word > &p, Compare cmp)
Sort all of the rules by cmp.
void replace_subword(Presentation< Word > &p, Word const &existing, Word const &replacement)
Replace non-overlapping instances of a subword by another word.
void add_identity_rules(Presentation< Word > &p, typename Presentation< Word >::letter_type e)
Add rules for an identity element.
Presentation< Word >::letter_type make_semigroup(Presentation< Word > &p)
Convert a monoid presentation to a semigroup presentation.
void reduce_complements(Presentation< Word > &p)
If there are rules and where , then replace by .
void normalize_alphabet(Presentation< Word > &p)
Normalize the alphabet to .
bool strongly_compress(Presentation< Word > &p)
Strongly compress a -relation presentation.
void add_cyclic_conjugates(Presentation< Word1 > &p, Word2 const &relator)
Add all cyclic permutations of a word as relators in a presentation.
void remove_redundant_generators(Presentation< Word > &p)
Remove any trivially redundant generators.
void greedy_reduce_length(Presentation< Word > &p)
Greedily reduce the length of the presentation using longest_subword_reducing_length.
void change_alphabet(Presentation< Word > &, Word const &)
Change or re-order the alphabet.
void add_inverse_rules(Presentation< Word > &p, Word const &vals, typename Presentation< Word >::letter_type e=UNDEFINED)
Add rules for inverses.
bool is_strongly_compressible(Presentation< Word > const &p)
Return true if the -relation presentation can be strongly compressed.
void remove_duplicate_rules(Presentation< Word > &p)
Remove duplicate rules.
size_t length(Iterator first, Iterator last)
Return the sum of the lengths of all values in the range [first, last).
std::string to_report_string(Presentation< Word > const &p)
Return a representation of a presentation to appear in the reporting output.
Presentation< Word >::letter_type first_unused_letter(Presentation< Word > const &p)
Return the first letter not in the alphabet of a presentation.
void add_cyclic_conjugates_no_checks(Presentation< Word1 > &p, Word2 const &relator)
Add all cyclic permutations of a word as relators in a presentation.
bool is_normalized(Presentation< Word > const &p)
Check if the presentation is normalized.
void add_rule(Presentation< Word > &p, Word const &lhop, Word const &rhop)
Add a rule to the presentation by reference and check.
Definition presentation.hpp:841
void throw_if_not_normalized(Presentation< Word > const &p, std::string_view arg="1st")
Throws if the presentation isn't normalized.
void add_zero_rules(Presentation< Word > &p, typename Presentation< Word >::letter_type z)
Add rules for a zero element.
std::string to_gap_string(Presentation< word_type > const &p, std::string const &var_name)
Return the code that would create p in GAP.
Namespace containing some operators for creating words.
Definition word-range.hpp:2095
Namespace for everything in the libsemigroups library.
Definition action.hpp:44
Empty base for presentation-like classes.
Definition presentation.hpp:77
A stateless struct with binary call operator using shortlex_compare.
Definition order.hpp:362