2009/11/08 by Hermiller, Susan, Lindblad, Steven, Meakin, John
#03D05 #20M05 #20M18 #FOS: Mathematics #Group Theory (math.GR)
paper · doi:10.48550/arxiv.0911.1484
We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the set of words in (X ∪ X-1)^* that represent the identity in M is a deterministic context free language, and that the set of geodesics in the Schutzenberger graph of the identity of M is a regular language.