Abstract
We give a combinatorial characterization of conjugacy in the sylvester monoid, showing that conjugacy is decidable for this monoid. We then prove that conjugacy is undecidable in general for homogeneous monoids and even for multihomogeneous monoids.
Original language | English |
---|---|
Pages (from-to) | 899-915 |
Number of pages | 17 |
Journal | International Journal Of Algebra And Computation |
Volume | 25 |
Issue number | 5 |
DOIs | |
Publication status | Published - 18 Aug 2015 |
Keywords
- Conjugacy
- decidability
- homogeneous monoid
- sylvester monoid (the monoid of binary search trees)