const_contains

tril libsemigroups::KnuthBendixCongruenceByPairs::const_contains(word_type const &u, word_type const &v) const

Check if a pair of words is known to belong to the congruence.

Return

Complexity

Linear in u.size() + v.size().

Parameters
  • u: a word (vector of integers) over the generators of the semigroup.

  • v: a word (vector of integers) over the generators of the semigroup.

Exceptions