On the decidability of the word problem for amalgamated free products of inverse semigroups.
The paper is investigating the decidability of the word problem of the amalgamated free product \(S_1*_US_2\) of an inverse semigroup amalgam \([S_1,S_2;U]\). The authors extend the methods of \textit{A. Cherubini, J. Meakin} and \textit{B. Piochi} [Semigroup Forum 54, No. 2, 199-220 (1997; Zbl 0872.20049)], based on \textit{P. Bennett}'s results [J.~Algebra 198, No. 2, 499-537 (1997; Zbl 0890.20042], and establish a list of five conditions on an inverse semigroup amalgam that guarantee the decidability of the word problem. The proof is technically rather involved. At the end of the paper an example is presented of two (isomorphic) inverse semigroups \(S_1\), \(S_2\) given by an idempotent pure presentation, with a common free monogenic inverse subsemigroup \(U\) and show that their theorem applies, whence \(S_1*_US_2\) has decidable word problem. It is remarked that the semigroups \(S_i\) have infinite \(\mathcal R\)-classes (the latter has long been considered to be an obstacle for the decidability of the word problem).
- Amalgamated free products of inverse semigroups
- Amalgams of free inverse semigroups.
- Free Inverse Semigroups
- Free products with amalgamation of inverse semigroups
- scientific article; zbMATH DE number 3869616 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 679816 (Why is no real title available?)
- Inverse Monoids, Trees, and Context-Free Languages
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- Presentations of inverse monoids
- Amalgams of finite inverse semigroups and deterministic context-free languages.
- Normal forms for semigroup amalgams
- Amalgams of inverse semigroups and reversible two-counter machines.
- A finiteness condition for R-classes of amalgams of inverse semigroups
- MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
- Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
- Bicyclic subsemigroups in amalgams of finite inverse semigroups.
- scientific article; zbMATH DE number 1560312 (Why is no real title available?)
- An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core
- Amalgams of free inverse semigroups.
This page was built for publication: On the decidability of the word problem for amalgamated free products of inverse semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481330)
