Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Uniform generation of infinite traces

Uniform generation of infinite traces AbstractWe introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed according to the exact uniform probability measure. The average size of the approximation grows linearly with the time of execution of the algorithm, provided that some–costly–precomputations have been done. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

Uniform generation of infinite traces

Abbes, Samy; Jugé, Vincent
Pure Mathematics and Applications , Volume 30 (1): 7 – Jun 1, 2022
Download PDF
7 pages

Loading next page...
 
/lp/de-gruyter/uniform-generation-of-infinite-traces-P7Q7PO8klR
Publisher
de Gruyter
Copyright
© 2022 Samy Abbes et al., published by Sciendo
eISSN
1788-800X
DOI
10.2478/puma-2022-0002
Publisher site
See Article on Publisher Site

Abstract

AbstractWe introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed according to the exact uniform probability measure. The average size of the approximation grows linearly with the time of execution of the algorithm, provided that some–costly–precomputations have been done.

Journal

Pure Mathematics and Applications – de Gruyter

Published: Jun 1, 2022

Keywords: trace monoid; Möbius polynomial; uniform measure; random generation; 68R05; 60B10; 06F05

There are no references for this article.