Algorithmic problems for finite groups and finite \(0\)-simple semigroups

DOI10.1016/S0022-4049(96)00050-3zbMath0880.20040MaRDI QIDQ1358940

O. Diekmann

Publication date: 9 February 1998

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

Brandt semigroupscompletely 0-simple semigroupspseudovarieties of finite groupsfinite direct productspseudovarieties of finite semigroupsword problemspseudovarieties of groupsdecidable membership problemsfinite 4-nilpotent subsemigroupsfinite completely 0-simple semigroupsrecursive sets of finite subsemigroups

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Quasivarieties and varieties of groups (20E10) Quasivarieties (08C15) Word problems (aspects of algebraic structures) (08A50)

Related Items

SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR, The pseudovariety generated by completely \(0\)-simple semigroups, Rees semigroups of digraphs for classification of data., Minsky Machines and Algorithmic Problems, Regular principal factors in free objects in Rees-Sushkevich varieties., The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups, Finite basis problem for 2-testable monoids., UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS, IDENTITIES IN BRANDT SEMIGROUPS, REVISITED, VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS, Regular principal factors in free objects in varieties in the interval \([\mathbf{B_2},\mathbf{NB_2}\vee\mathbf{G_n}\).], LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS, FAITHFUL FUNCTORS FROM CANCELLATIVE CATEGORIES TO CANCELLATIVE MONOIDS WITH AN APPLICATION TO ABUNDANT SEMIGROUPS, Undecidability of representability as binary relations, Natural dualities, nilpotence and projective planes, A minimal nonfinitely based semigroup whose variety is polynomially recognizable., Some conditions related to the exactness of Rees-Sushkevich varieties., The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion, Finite quasivarieties and self-referential conditions, COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES, Complete Congruences on the Lattice of Rees–Sushkevich Varieties, COMBINATORIAL REES–SUSHKEVICH VARIETIES THAT ARE CROSS, FINITELY GENERATED, OR SMALL, Potential Divisibility in Finite Semigroups is Undecidable, A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive, A formula for multiple classifiers in data mining based on Brandt semigroups, Shades of orthodoxy in Rees-Sushkevich varieties., Undecidable problems for completely 0-simple semigroups., ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS, Algorithmic problems for amalgams of finite semigroups, On the rank of the Rees–Sushkevich varieties, Undecidability of Algebras of Binary Relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categories as algebra: An essential ingredient in the theory of monoids
• Unsolvability of the universal theory of finite groups
• Local varieties of completely regular monoids
• On pseudovarieties
• THE WORD PROBLEM FOR SOLVABLE LIE ALGEBRAS AND GROUPS
• Semidirect products of regular semigroups
• ALGORITHMIC PROBLEMS IN VARIETIES
• The Word Problem for Abstract Algebras