Rewriting systems and word problems in a free partially commutative monoid (Q1102124)
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: Rewriting systems and word problems in a free partially commutative monoid |
scientific article; zbMATH DE number 4049094
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rewriting systems and word problems in a free partially commutative monoid |
scientific article; zbMATH DE number 4049094 |
Statements
Rewriting systems and word problems in a free partially commutative monoid (English)
0 references
1987
0 references
rewriting systems
0 references
free partially commutative monoid
0 references
decidable word problem
0 references
finite Thue systems
0 references
0 references
0.8935955762863159
0 references
0.8554174900054932
0 references
0.8426497578620911
0 references
0.8397040367126465
0 references
