BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS

DOI10.1142/S021819671000556XzbMath1201.20061MaRDI QIDQ3552317

Emanuele Rodaro

Publication date: 15 April 2010

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

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

zbMATH Keywords

free products with amalgamation; amalgams; finite inverse semigroups; polynomial time algorithms; completely semisimple semigroups; bicyclic semigroups; completely semisimplicity problem

Mathematics Subject Classification ID

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

20M18: Inverse semigroups

Related Items

An amalgam of inverse semigroups is embedded into an amalgam with a lower bounded core, Some completely semisimple HNN-extensions of inverse semigroups, Amalgams of finite inverse semigroups and deterministic context-free languages., Maximal subgroups of amalgams of finite inverse semigroups., Normal forms for semigroup amalgams, Amalgams of inverse semigroups and reversible two-counter machines., MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS, Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amalgams of free inverse semigroups.
• The \(\alpha\)-bicyclic semigroup as a topological semigroup
• Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
• A generalization of the bicyclic semigroup
• The fundamental four-spiral semigroup
• Amalgams of finite inverse semigroups.
• Free products of inverse semigroups II
• On the Structure of Inverse Semigroup Amalgams
• Amalgamated free products of inverse semigroups