It is undecidable whether a finite special string-rewriting system presents a group (Q1184861): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q987702 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Leonid A. Bokut' / rank | |||
Normal rank | |||
Revision as of 00:54, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | It is undecidable whether a finite special string-rewriting system presents a group |
scientific article |
Statements
It is undecidable whether a finite special string-rewriting system presents a group (English)
0 references
28 June 1992
0 references
Let \(G=(\Sigma;R)\) be a finitely presented (f.p.) group with undecidable word problem, \(w\in\Sigma^*\), \(G(w)=(\Sigma\cup\{a,b\}\); \(R\), \(awbbaab=1\)) be a f.p. (special) semigroup. It is shown that \(G(w)\) is a group iff \(w=1\) in \(G\). This gives the theorem formulated in the title.
0 references
finitely presented special semigroups
0 references
finitely presented group
0 references
word problem
0 references
