The word problem for nilpotent inverse monoids (Q1902161): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3859267 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4126563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inverse Monoids, Trees, and Context-Free Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Free Inverse Semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <i>E</i>-unitary congruences on inverse semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3337662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Free Inverse Semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Presentations of inverse monoids / rank | |||
Normal rank |
Latest revision as of 18:13, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The word problem for nilpotent inverse monoids |
scientific article |
Statements
The word problem for nilpotent inverse monoids (English)
0 references
4 June 1996
0 references
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.
0 references
inverse semigroups
0 references
Rees quotients
0 references
free inverse monoids
0 references
finitely generated congruences
0 references
quotient monoids
0 references
decidable word problem
0 references
finite \({\mathcal D}\)-classes
0 references