The 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.

Undecidability of the word problem for Yamamura’s HNN-extension under nice conditions

RODARO, EMANUELE
2016-01-01

Abstract

The 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.
2016
Amalgams of Inverse Semigroups; HNN-extension; Inverse Semigroups; Undecidability; Word Problem; Algebra and Number Theory
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1007694
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact