We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case, and show that it has decidable membership problem. We establish several algorithmic properties of the class of finite--above (inverse) monoids. We prove that the image of the eraser morphism in the free inverse monoid case (and more generally, in the finite--above case) has decidable membership problem, and relate its kernel to the free group fragile words.

Eraser morphisms and membership problem in groups and monoids

D'Angeli, D;Rodaro, E;
2020

Abstract

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case, and show that it has decidable membership problem. We establish several algorithmic properties of the class of finite--above (inverse) monoids. We prove that the image of the eraser morphism in the free inverse monoid case (and more generally, in the finite--above case) has decidable membership problem, and relate its kernel to the free group fragile words.
File in questo prodotto:
File Dimensione Formato  
Eraser morphisms and membership problem in groups and monoids.pdf

Accesso riservato

: Publisher’s version
Dimensione 2.29 MB
Formato Adobe PDF
2.29 MB 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: http://hdl.handle.net/11311/1141860
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact