Autores
Orientador(es)
Resumo(s)
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.
Descrição
Project PEST-C/MAT/UI0144/2011.
fellowship (IF/01622/2013/CP1161/CT0001).
Palavras-chave
Conjugacy decidability homogeneous monoid sylvester monoid (the monoid of binary search trees) General Mathematics
