Undecidability of the word problem for Yamamura's HNN-extension under nice conditions.

DOI10.1007/s00233-015-9750-0zbMath1347.20061MaRDI QIDQ305764

Mohammed Abu Ayyash, Emanuele Rodaro

Publication date: 30 August 2016

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-015-9750-0

zbMATH Keywords

undecidability; word problem; HNN-extensions; computability; amalgams of inverse semigroups

Mathematics Subject Classification ID

20M05: Free semigroups, generators and relations, word problems

20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations

20M18: Inverse semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presentations of inverse monoids
• Embedding theorems for HNN extensions of inverse semigroups.
• Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
• HNN extensions of semigroups
• HNN extensions of inverse semigroups and groupoids.
• Combinatorial group theory.
• Amalgams of finite inverse semigroups.
• Amalgams of inverse semigroups and reversible two-counter machines.
• Locally full HNN extensions of inverse semigroups
• The Word Problem for HNN-extensions of Free Inverse Semigroups
• Amalgams vs Yamamura's HNN-Extensions of Inverse Semigroups
• Free products of inverse semigroups II
• Free Inverse Semigroups
• HNN Extensions of Inverse Semigroups and Applications
• EMBEDDING THEOREMS FOR SEMIGROUPS