Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups

被引：14

作者：

Rodaro, Emanuele ^{[1
]}

Cherubini, Alessandra ^{[1
]}

机构：

[1] Politecn Milan, Dipartimento Matemat F Brioschi, I-20133 Milan, Italy

来源：

SEMIGROUP FORUM | 2008年 / 77卷 / 02期

关键词：

inverse semigroup; word problem; Schutzenberger automaton; HNN-exstension;

D O I：

10.1007/s00233-008-9050-z

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that the word problem is decidable in Yamamura's HNN extensions of finite inverse semigroups, by providing an iterative construction of approximate automata of the Schutzenberger automata of words relative to the standard presentation of Yamamura's HNN-extensions.

引用

页码：163 / 186

页数：24

共 17 条

[1] Amalgamated free products of inverse semigroups [J].

Bennett, P .

JOURNAL OF ALGEBRA, 1997, 198 (02) :499-537

[2] Amalgams of finite inverse semigroups [J].

Cherubini, A ;

Meakin, J ;

Piochi, B .

JOURNAL OF ALGEBRA, 2005, 285 (02) :706-725

[3] HNN extensions of inverse semigroups and groupoids [J].

Gilbert, ND .

JOURNAL OF ALGEBRA, 2004, 272 (01) :27-45

[4]

Higman G., 1949, J LOND MATH SOC, V24, P247, DOI [10.1112/jlms/s1-24.4.247, 10.1112/jlms/s1-24.4.247.t3]

[5] EMBEDDING THEOREMS FOR SEMIGROUPS [J].

HOWIE, JM .

QUARTERLY JOURNAL OF MATHEMATICS, 1963, 14 (56) :254-&

[6]

JAJCAYOVA T, THESIS U NEBRASKA LI

[7]

Lawson MV, 1998, INVERSE SEMIGROUPS T, DOI DOI 10.1142/3645

[8]

Lyndon R. C., 1977, Combinatorial group theory, V89

[9]

MEAKIN J, 1993, P HONG KONG C ORD ST

[10]

Paterson A.L.T., 1999, GRUPOIDS INVERSE SEM

← 1 2 →