On the algorithmic decidability of the square-free word problem relative to a system of two defining relations (Q893718)
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 algorithmic decidability of the square-free word problem relative to a system of two defining relations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
