On the solvability of word problem by Adian graphs. (Q2918435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the solvability of word problem by Adian graphs. |
scientific article; zbMATH DE number 6092056
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the solvability of word problem by Adian graphs. |
scientific article; zbMATH DE number 6092056 |
Statements
6 October 2012
0 references
Adian graphs
0 references
semigroup presentations
0 references
word problem
0 references
rewriting systems
0 references
On the solvability of word problem by Adian graphs. (English)
0 references
