P-complete

Aperiodic Monoid Membership Variety $B_2$ (AMonMEMB)

Category: Algebra

Input

A set of total functions $a_1, \ldots, a_r$ and a designated function $f$, all from the set $\{1, 2, \ldots, m\}$ to itself, with the property that $\langle a_1, \ldots, a_r \rangle \in B_2$.

Problem

Does $f$ belong to $\langle a_1, \ldots, a_r \rangle$?

Definitions

Value $\langle a_1, \ldots, a_r \rangle$ denotes the set of all functions obtained by composing the functions $a_i$ with one another. $B_2$ is a restricted class of aperiodic monoids. Refer to [1] for further definitions.

Status

$\P$-complete (Beaudry, McKenzie, and Thérien [1]).

Remarks

The reduction to show hardness is from a variant of GEN.

The lattice of aperiodic monoid varieties is partitioned in [1] into the following five sublattices: $B_1$, $B_2$, $B_3$, $B_4$, and $B_5$. The membership problem for varieties in $B_2$ as described above is $\P$-complete. For varieties in $B_1$ the problem is in $\mathsf{AC}^0$; for $B_3$ it is $\NP$-complete; for $B_4$ it is $\NP$-hard; for $B_5$ it is $\mathsf{PSPACE}$-complete [1].

References

  1. M. Beaudry, P. McKenzie, and D. Thérien (1992). The membership problem in aperiodic transformation monoids.
  2. Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Problem A.8.27.