The word problem for nilpotent inverse monoids
type: Item
instance of: scholarly article
title: The word problem for nilpotent inverse monoids
zbMATH Open document ID: 0838.20059
DOI: 10.1007/BF02573637
author: Pedro V. Silva
published in: Semigroup Forum
publication date: 1996-06-04T00:00:00Z
full work available at URL: https://eudml.org/doc/135416
review text: The author says that an inverse semigroup \(S\) is \(k\)-nilpotent if \(S\) has a zero and \(a^k=0\) for every non-idempotent \(a\in S\). Let \(N_k(X)\) denote the largest \(k\)-nilpotent Rees quotient of the free inverse monoid on the set \(X\). The author proves that, for every \(k\geq 1\) and for every finitely generated congruence \(\tau\) on \(N_k(X)\), the quotient monoid \(N_k(X)/\tau\) has decidable word problem and finite \({\mathcal D}\)-classes.
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 20M18
zbMATH DE Number: 815960
zbMATH Keywords: inverse semigroups
zbMATH Keywords: Rees quotients
zbMATH Keywords: free inverse monoids
zbMATH Keywords: finitely generated congruences
zbMATH Keywords: quotient monoids
zbMATH Keywords: decidable word problem
zbMATH Keywords: finite \({\mathcal D}\)-classes
MaRDI profile type: Publication
cites work: Q3859267
cites work: Q4079524
cites work: Q5592246
cites work: Q4126563
cites work: Q3659988
cites work: Inverse Monoids, Trees, and Context-Free Languages
cites work: Free Inverse Semigroups
cites work: E-unitary congruences on inverse semigroups
cites work: Q3337662
cites work: RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
cites work: Presentations of inverse monoids
description: scientific article; zbMATH DE number 815960