On the decidability of the word problem for amalgamated free products of inverse semigroups.

DOI10.1007/S00233-007-9030-8MaRDI QIDQ2481330zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

inverse semigroupsdecidabilityamalgamated free productsword problem

Mathematics Subject Classification ID

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

Recommendations

• Amalgams of finite inverse semigroups.
• Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
• Amalgams of inverse semigroups and reversible two-counter machines.
• Normal forms for semigroup amalgams
• Amalgams of free inverse semigroups.

Cites work

• 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?)
• Amalgamated free products of inverse semigroups
• Amalgams of free inverse semigroups.
• Free Inverse Semigroups
• 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
• Presentations of inverse monoids

Cited in

(9)

• An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core
• A finiteness condition for R-classes of amalgams of inverse semigroups
• Amalgams of finite inverse semigroups and deterministic context-free languages.
• Bicyclic subsemigroups in amalgams of finite inverse semigroups.
• Normal forms for semigroup amalgams
• scientific article; zbMATH DE number 1560312 (Why is no real title available?)
• MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
• Decidability versus undecidability of the word problem in amalgams of 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)