Algorithmic problems for finite groups and finite semigroups
From MaRDI portal
This paper is a survey of recent results on the decidability and the undecidability of some problems in the theory of the Birkhoff operators for classes of finite semigroups (groups). For the entire collection see [Zbl 0931.00032].
Recommendations
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- scientific article; zbMATH DE number 988810
- scientific article; zbMATH DE number 1521041
- Algorithms for computing finite semigroups
- Algorithmic problems in varieties of semigroups
- scientific article; zbMATH DE number 4051899
- Algorithms for finite soluble groups and applications
- On some algorithmic problems for groups and monoids
- Algorithms for polycyclic-by-finite groups
- scientific article; zbMATH DE number 919761
Cited in
(11)- Algorithmically complex residually finite groups
- Algorithmic problems in groups and semigroups. Based on talks given at the international conference, Lincoln, NE, USA, May 11--May 16, 1998
- Semigroups of RN-algorithms
- scientific article; zbMATH DE number 4181317 (Why is no real title available?)
- scientific article; zbMATH DE number 3875526 (Why is no real title available?)
- scientific article; zbMATH DE number 1257081 (Why is no real title available?)
- scientific article; zbMATH DE number 486618 (Why is no real title available?)
- scientific article; zbMATH DE number 1944134 (Why is no real title available?)
- scientific article; zbMATH DE number 2014436 (Why is no real title available?)
- Algorithms for polycyclic-by-finite groups
- Algorithmically finite groups.
This page was built for publication: Algorithmic problems for finite groups and finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942273)