Show simple item record

dc.contributor.authorAbu Ayyash, Mohammed
dc.contributor.authorRodaro, Emanuele
dc.date.accessioned2018-09-14T09:33:13Z
dc.date.available2018-09-14T09:33:13Z
dc.date.issued2016-04
dc.identifier.issn0037-1912
dc.identifier.urihttp://dspace.bethlehem.edu:8080/xmlui/handle/123456789/65
dc.description.abstractThe solvability of the word problem for Yamamura’s HNN-extensions [S; A1, A2; ϕ] has been proved in some particular cases. However, we show that, contrary to the group case, the word problem for [S; A1A2; ϕ] is undecidable even if we consider S to have finite R-classes, A1 and A2 to be free inverse subsemigroups of finite rank and with zero, and ϕ , ϕ−1 to be computable.en_US
dc.description.sponsorshipItalian Ministry of Foreign Affairs and Bethlehem University through the Italian project E-PLUS, and also acknowledges the PRIN project 2011 “Automi e Linguaggi Formali: Aspetti Matematici e Applicativi”en_US
dc.language.isoenen_US
dc.publisherSemigroup Forumen_US
dc.relation.ispartofseriesDOI 10.1007/s00233-015-9750-0;
dc.subjectHNN-extension · Inverse Semigroups · Word Problem · Undecidability · Amalgams of Inverse Semigroupsen_US
dc.titleUndecidability of the word problem for Yamamura’s HNN-extension under nice conditionsen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record