pith. sign in

arxiv: 1506.02455 · v1 · pith:3NVMUN7Nnew · submitted 2015-06-08 · 💻 cs.FL

Uniform generation in trace monoids

classification 💻 cs.FL
keywords uniformgenerationmonoidinfinitymeasurerandomtracealgorithms
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.