Uniform generation in trace monoids
Formal Languages and Automata Theory
2015-06-09 v1
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.
Cite
@article{arxiv.1506.02455,
title = {Uniform generation in trace monoids},
author = {Samy Abbes and Jean Mairesse},
journal= {arXiv preprint arXiv:1506.02455},
year = {2015}
}
Comments
Full version of the paper in MFCS 2015 with the same title