word problem;
semigroups amalgams;
inverse semigroups;
Schutzenberger graph;
D O I:
10.1016/j.jalgebra.2004.12.015
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We show that the word problem is decidable for an amalgamated free product of finite inverse semigroups (in the category of inverse semigroups). This is in contrast to a recent result of M. Sapir that shows that the word problem for amalgamated free products of finite semigroups (in the category of semigroups) is in general undecidable. (c) 2005 Elsevier Inc. All rights reserved.