Partially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoid are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. An O(n log(n)) algorithm on a RAM for the word problem is presented, and NP-completeness of the generalized word problem and the membership problem for rational sets is shown. Moreover, free partially commutative inverse monoids modulo a finite idempotent presentation are studied. For these monoids, the word problem is decidable if and only if the complement of the commutation relation is transitive.
Unable to display preview. Download preview PDF.
- 4.Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)Google Scholar
- 11.Margolis, S., Meakin, J., Sapir, M.: Algorithmic problems in groups, semigroups and inverse semigroups. In: Semigroups, Formal Languages and Groups, pp. 147–214. Kluwer, Dordrecht (1995)Google Scholar
- 13.Mihailova, K.A.: The occurrence problem for direct products of groups. Math. USSR Sbornik 70, 241–251 (1966) (English translation)Google Scholar
- 17.Veloso da Costa, A.: Γ-Produtos de Monóides e Semigrupos. PhD thesis, Universidade do Porto (2003)Google Scholar