Trace monoids with some invertible generators: Two decision problems (Q1179186)
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: Trace monoids with some invertible generators: Two decision problems |
scientific article; zbMATH DE number 24097
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trace monoids with some invertible generators: Two decision problems |
scientific article; zbMATH DE number 24097 |
Statements
Trace monoids with some invertible generators: Two decision problems (English)
0 references
26 June 1992
0 references
The paper studies monoids which are obtained from free monoids by stating that some pairs of generators have to commute and some pairs of generators have to be mutually inverse. For the investigation of such monoids Thue systems are used. Among other things, the paper concerns the word problem and the conjugacy problem, i.e. the problem to recognize conjugate pairs, where two elements \(x\), \(y\) are called conjugate, if \(xw=wy\) for some element \(w\).
0 references
free monoids
0 references
generators
0 references
Thue systems
0 references
word problem
0 references
conjugacy problem
0 references
