Pages that link to "Item:Q1358940"

The following pages link to Algorithmic problems for finite groups and finite \(0\)-simple semigroups (Q1358940):

Displaying 21 items.

• Rees semigroups of digraphs for classification of data. (Q284651) (← links)
• Regular principal factors in free objects in varieties in the interval \([\mathbf{B_2},\mathbf{NB_2}\vee\mathbf{G_n}]\). (Q467530) (← links)
• Natural dualities, nilpotence and projective planes (Q494622) (← links)
• Finite basis problem for 2-testable monoids. (Q632275) (← links)
• A formula for multiple classifiers in data mining based on Brandt semigroups (Q1014262) (← links)
• Shades of orthodoxy in Rees-Sushkevich varieties. (Q1014791) (← links)
• Undecidable problems for completely 0-simple semigroups. (Q1025071) (← links)
• The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups (Q1403857) (← links)
• Algorithmic problems for amalgams of finite semigroups (Q1579152) (← links)
• Finite quasivarieties and self-referential conditions (Q1770617) (← links)
• Regular principal factors in free objects in Rees-Sushkevich varieties. (Q1941750) (← links)
• A minimal nonfinitely based semigroup whose variety is polynomially recognizable. (Q2248321) (← links)
• The pseudovariety generated by completely \(0\)-simple semigroups (Q2365284) (← links)
• Some conditions related to the exactness of Rees-Sushkevich varieties. (Q2480762) (← links)
• On the rank of the Rees–Sushkevich varieties (Q2849066) (← links)
• Minsky Machines and Algorithmic Problems (Q2947180) (← links)
• UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS (Q2971054) (← links)
• LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS (Q2996847) (← links)
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES (Q3043639) (← links)
• Undecidability of representability as binary relations (Q4899169) (← links)
• IDENTITIES IN BRANDT SEMIGROUPS, REVISITED (Q5125245) (← links)