'A variation of ``define`` routine, described on Pg. 165 [1], used in
the coset table-based strategy of Todd-Coxeter algorithm. It differs
from ``define`` routine in that for each definition it also adds the
tuple `(\alpha, x)` to the deduction stack.
See Also
define'

def define_c(self, alpha, x, max_cosets=coset_table_max_limit):

    A = self.A
    table = self.table
    len_table = len(table)
    if (len_table == self.coset_table_max_limit):
        raise ValueError(('the    coset    enumeration    has    defined    more    than    %s    cosets.    Try    with    a    greater    value    max    number    of    cosets    ' % max_cosets))
    table.append(([None] * len(A)))
    beta = len_table
    self.p.append(beta)
    table[alpha][self.A_dict[x]] = beta
    table[beta][self.A_dict_inv[x]] = alpha
    self.deduction_stack.append((alpha, x))
