Algorithmic problems for amalgams of finite semigroups
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 32084 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1182704 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3065870 (Why is no real title available?)
- ALGORITHMIC PROBLEMS IN VARIETIES
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Amalgamated Products of Semigroups: The Embedding Problem
- Amalgamation and Inverse and Regular Semigroups
- Epimorphisms and amalgams
- Finite and infinite cyclic extensions of free groups
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- ON THE WORD PROBLEM IN PERIODIC GROUP VARIETIES
- Potential Divisibility in Finite Semigroups is Undecidable
- The Potential -Relation and Amalgamation Bases for Finite Semigroups
- The Word Problem for Abstract Algebras
- The class of embeddable semigroup amalgams is not finitely axiomatizable
- Unsolvability of the universal theory of finite groups
Cited in
(16)- Minsky Machines and Algorithmic Problems
- Semigroups of RN-algorithms
- A semigroup of paths on a sequence of uniformly elliptic complexes
- Undecidable problems for completely 0-simple semigroups.
- Normal forms for semigroup amalgams
- scientific article; zbMATH DE number 1563405 (Why is no real title available?)
- scientific article; zbMATH DE number 1560312 (Why is no real title available?)
- Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
- Finitely presented nilsemigroups: complexes with the property of uniform ellipticity
- On the Universal Theory of Torsion and Lacunary Hyperbolic Groups
- Amalgams of finite inverse semigroups.
- Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
- ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS
- Amalgams of inverse semigroups and reversible two-counter machines.
- Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup
- Amalgams of free inverse semigroups.
This page was built for publication: Algorithmic problems for amalgams of finite semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579152)
