2000 character limit reached
Uniform generation in trace monoids
Published 8 Jun 2015 in cs.FL | (1506.02455v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.