Algorithmic problems for amalgams of finite semigroups

DOI10.1006/jabr.1999.8138zbMath0959.20050OpenAlexW1972395679MaRDI QIDQ1579152

Mark V. Sapir

Publication date: 19 November 2000

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.1999.8138

zbMATH Keywords

finite semigroupsamalgamated productsundecidable word problemembeddability of finite semigroup amalgamsMinsky algorithms

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05)

Related Items (11)

Finitely presented nilsemigroups: complexes with the property of uniform ellipticity ⋮ Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups ⋮ Amalgams of inverse semigroups and reversible two-counter machines. ⋮ Minsky Machines and Algorithmic Problems ⋮ A semigroup of paths on a sequence of uniformly elliptic complexes ⋮ Amalgams of free inverse semigroups. ⋮ Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups. ⋮ Amalgams of finite inverse semigroups. ⋮ Undecidable problems for completely 0-simple semigroups. ⋮ ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS ⋮ Normal forms for semigroup amalgams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unsolvability of the universal theory of finite groups
• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• The class of embeddable semigroup amalgams is not finitely axiomatizable
• ON THE WORD PROBLEM IN PERIODIC GROUP VARIETIES
• The Potential -Relation and Amalgamation Bases for Finite Semigroups
• Epimorphisms and amalgams
• Finite and infinite cyclic extensions of free groups
• Amalgamated Products of Semigroups: The Embedding Problem
• Amalgamation and Inverse and Regular Semigroups
• ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
• Potential Divisibility in Finite Semigroups is Undecidable
• ALGORITHMIC PROBLEMS IN VARIETIES
• The Word Problem for Abstract Algebras

This page was built for publication: Algorithmic problems for amalgams of finite semigroups