Publication | Closed Access
A PROFINITE APPROACH TO STABLE PAIRS
14
Citations
16
References
2010
Year
Aperiodic MonoidsCommutative AlgebraCombinatorial DesignAlgebraic CombinatoricsTransformation SemigroupsUniversal AlgebraStable PairsProfinite TechniquesOriented Matroids
We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.
| Year | Citations | |
|---|---|---|
Page 1
Page 1