Conjugacy in free inverse monoids

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The notion of conjugacy in groups can be extended in two ways to monoids. We keep on calling conjugacy the first version (two elements x and y are conjugate if xz=zy holds for some z), while we call transposition the second one (two elements x and y are transposed conjugate if x=uv and y=vu holds for some u,v). Using the characterization of elements in free inverse monoids due to Munn, we show that restricted to non idempotents, the relation of conjugacy is the transitive closure of the relation of transposition. Furthermore, we show that conjugacy between two elements of a free inverse monoid can be tested in linear time.

Cite

CITATION STYLE

APA

Choffrut, C. (1993). Conjugacy in free inverse monoids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 677 LNCS, pp. 6–22). Springer Verlag. https://doi.org/10.1007/3-540-56730-5_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free