On the algorithmic decidability of the square-free word problem relative to a system of two defining relations (Q893718)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithmic decidability of the square-free word problem relative to a system of two defining relations |
scientific article |
Statements
On the algorithmic decidability of the square-free word problem relative to a system of two defining relations (English)
0 references
20 November 2015
0 references
