Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264): Difference between revisions

@@ Property / cites work @@
+The equivalence problem for finite rings
@@ Property / cites work: The equivalence problem for finite rings / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the equivalence problem for finite groups.
+Normal rank
@@ Property / cites work @@
+The complexity of the equivalence problem for nonsolvable groups
+Normal rank
@@ Property / cites work @@
+Congruence modular varieties with small free spectra
+Normal rank
@@ Property / cites work @@
+COMPLEXITY OF SEMIGROUP IDENTITY CHECKING
@@ Property / cites work: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / rank @@
+Normal rank
@@ Property / cites work @@
+On representable graphs
@@ Property / cites work: On representable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Free Objects in Certain Varieties of Inverse Semigroups
+Normal rank
@@ Property / cites work @@
+SOME INDECOMPOSABLE VARIETIES OF GROUPS
@@ Property / cites work: SOME INDECOMPOSABLE VARIETIES OF GROUPS / rank @@
+Normal rank
@@ Property / cites work @@
+Bases for equational theories of semi-groups
@@ Property / cites work: Bases for equational theories of semi-groups / rank @@
+Normal rank
@@ Property / cites work @@
+Free Combinatorial Strict Inverse Semigroups
@@ Property / cites work: Free Combinatorial Strict Inverse Semigroups / rank @@
+Normal rank
@@ Property / cites work @@
+THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM
+Normal rank
@@ Property / cites work @@
+Monoids with sub-log-exponential free spectra.
@@ Property / cites work: Monoids with sub-log-exponential free spectra. / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
+Normal rank
@@ Property / cites work @@
+Asymptotic growth of free spectra of band monoids.
+Normal rank
@@ Property / cites work @@
+The complexity of the word-problem for finite matrix rings
+Normal rank
@@ Property / cites work @@
+The complexity of checking identities for finite matrix rings
+Normal rank
@@ Property / cites work @@
+Checking quasi-identities in a finite semigroup may be computationally hard.
+Normal rank