This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups. Some decidability results for special types of amalgams are summarized pointing out where and how the conditions posed on amalgams are used to guarantee the decidability of the word problem. Then a recent result on undecidability is shortly illustrated to show how small is the room between decidability and undecidability of the word problem in amalgams of inverse semigroups.

Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups

CHERUBINI, ALESSANDRA;RODARO, EMANUELE
2015-01-01

Abstract

This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups. Some decidability results for special types of amalgams are summarized pointing out where and how the conditions posed on amalgams are used to guarantee the decidability of the word problem. Then a recent result on undecidability is shortly illustrated to show how small is the room between decidability and undecidability of the word problem in amalgams of inverse semigroups.
2015
Smigroups, algebras and operator theory
978-81-322-2487-7
Inverse semigroup, Amalgams, Schuetzenberger automata, Cactoid inverse automata
File in questo prodotto:
File Dimensione Formato  
327580_1_En_1_Chapter_Author%20(1).pdf

Accesso riservato

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 661.84 kB
Formato Adobe PDF
661.84 kB Adobe PDF   Visualizza/Apri

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/981136
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact