On the decidability of the word problem for amalgamated free products of inverse semigroups.
From MaRDI portal
Publication:2481330
DOI10.1007/S00233-007-9030-8zbMATH Open1158.20029OpenAlexW2083504485MaRDI QIDQ2481330FDOQ2481330
Authors: Marco Mazzucchelli, A. Cherubini 
Publication date: 9 April 2008
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-007-9030-8
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free Inverse Semigroups
- Presentations of inverse monoids
- Title not available (Why is that?)
- Free products with amalgamation of inverse semigroups
- Inverse Monoids, Trees, and Context-Free Languages
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- Amalgamated free products of inverse semigroups
- Amalgams of free inverse semigroups.
Cited In (9)
- An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core
- Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups
- A finiteness condition for \(\mathcal R\)-classes of amalgams of inverse semigroups
- Bicyclic subsemigroups in amalgams of finite inverse semigroups.
- Amalgams of finite inverse semigroups and deterministic context-free languages.
- Normal forms for semigroup amalgams
- Title not available (Why is that?)
- MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
- Amalgams of inverse semigroups and reversible two-counter machines.
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)
