On the decidability of the word problem for amalgamated free products of inverse semigroups - Archive ouverte HAL Access content directly
Journal Articles Semigroup Forum Year : 2008

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

(1) , (2)
1
2

Abstract

We study inverse semigroup amalgams [S 1 , S 2 ; U ], where S 1 and S 2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S 1 and S 2. We use a modified version of Bennett's work on the structure of Schützenberger graphs of the R-classes of S 1 * U S 2 to state sufficient conditions for the amalgamated free products S 1 * U S 2 having decidable word problem.
Fichier principal
Vignette du fichier
amalgam.pdf (297.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-01404257 , version 1 (28-11-2016)

Identifiers

Cite

Marco Mazzucchelli, Alessandra Cherubini. On the decidability of the word problem for amalgamated free products of inverse semigroups. Semigroup Forum, 2008, 76, pp.309 - 329. ⟨10.1007/s00233-007-9030-8⟩. ⟨ensl-01404257⟩
105 View
106 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More