New coins from old: Computing with unknown bias

DOI10.1007/s00493-005-0043-1zbMath1099.68052arXivmath/0304143OpenAlexW2130311428WikidataQ104523606 ScholiaQ104523606MaRDI QIDQ2368597

Elchanan Mossel, Yuval Peres

Publication date: 27 June 2006

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0304143

zbMATH Keywords

rational functionfinite automatonpushdown automatonalgebraic functionsimulation of a function

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (8)

Aleatoric propositions: reasoning about coins ⋮ Multiparameter Bernoulli factories ⋮ Bernoulli Factories for Flow-Based Polytopes ⋮ Combinatorial Bernoulli factories ⋮ New coins from old, smoothly ⋮ Simulating events of unknown probabilities via reverse time martingales ⋮ Coalgebraic tools for randomness-conserving protocols ⋮ From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains

This page was built for publication: New coins from old: Computing with unknown bias