2000 character limit reached
Uniform generation in trace monoids (1506.02455v1)
Published 8 Jun 2015 in cs.FL
Abstract: We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of the uniform measure on the boundary at infinity of the associated monoid. We obtain a product decomposition of the uniform measure at infinity if the trace monoid has several irreducible components-a case where other notions such as Parry measures, are not defined. Random generation algorithms are then examined.