The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that generate a single string, are used in this paper. It is shown that the compressed word problem for a free inverse monoid of finite rank at least two is complete for Pi^p_2 (second universal level of the polynomial time hierarchy). Moreover, it is shown thatarXiv:1106.1000v1 fatcat:kmys7kimafbqlm2morr2g3yfri