CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS

DOI10.1142/S0218196796000349zbMath0874.20042OpenAlexW2088131218MaRDI QIDQ4335882

Pedro V. Silva

Publication date: 4 September 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196796000349

zbMATH Keywords

inverse monoid presentationsconjugacy relationsfree inverse monoidsdecidable equivalence relationsrestricted Dyck wordstransposition relations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Subalgebras, congruence relations (08A30) Inverse semigroups (20M18)

Related Items

A solvable conjugacy problem for finitely presented semigroups satisfying \(C(2)\) and \(T(4)\) ⋮ On conjugate elements in a semigroup and semigroup diagrams ⋮ Deciding conjugacy in sylvester monoids and other homogeneous monoids ⋮ The Knuth-Bendix algorithm and the conjugacy problem in monoids. ⋮ Trees associated to inverse monoid presentations ⋮ On three approaches to conjugacy in semigroups. ⋮ Commutativity in free inverse monoids ⋮ FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS

This page was built for publication: CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS