An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core

DOI10.1142/S0218196721400129OpenAlexW3174124336MaRDI QIDQ4957777

Paul M. Bennett

Publication date: 9 September 2021

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196721400129

zbMATH Keywords

maximal subgroupsword problemamalgamsinverse semigroupsSchützenberger automatacompletely semisimple

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Presentations of inverse monoids
• Amalgams of free inverse semigroups.
• Free products with amalgamation of inverse semigroups
• Amalgams of finite inverse semigroups and deterministic context-free languages.
• Amalgams of finite inverse semigroups.
• Bass-Serre theory for groupoids and the structure of full regular semigroup amalgams
• Maximal subgroups of amalgams of finite inverse semigroups.
• On the decidability of the word problem for amalgamated free products of inverse semigroups.
• MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
• BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS
• Free products of inverse semigroups II
• On the Structure of Inverse Semigroup Amalgams
• Amalgamated free products of inverse semigroups
• Amalgamated free products of inverse semigroups