From: Christophe Guyeux <christophe.guyeux@univ-fcomte.fr>
Date: Sun, 15 Mar 2015 08:16:20 +0000 (+0100)
Subject: Avancées dans la relecture des exp
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rairo15.git/commitdiff_plain/5207d2fe1ec5d598398e217569e592f0fb6a07ff?hp=d5564eebac75434c4a578ef739c24590e52b7844

Avancées dans la relecture des exp
---

diff --git a/prng.tex b/prng.tex
index db2e5e7..c565970 100644
--- a/prng.tex
+++ b/prng.tex
@@ -1,13 +1,13 @@
-Let us finally present the pseudorandom number generator $\chi_{\textit{15Rairo}}$
+Let us finally present the pseudorandom number generator $\chi_{\textit{15Rairo}}$,
 which is based on random walks in $\Gamma_{\{b\}}(f)$. 
 More precisely, let be given a Boolean map $f:\Bool^{\mathsf{N}} \rightarrow 
 \Bool^\mathsf{N}$,
 a PRNG \textit{Random},
-an integer $b$ that corresponds an iteration number (\textit{i.e.}, the length of the walk), and 
+an integer $b$ that corresponds to an iteration number (\textit{i.e.}, the length of the walk), and 
 an initial configuration $x^0$. 
 Starting from $x^0$, the algorithm repeats $b$ times 
-a random choice of which edge to follow and traverses this edge 
-provided it is allowed to traverse it, \textit{i.e.}, 
+a random choice of which edge to follow, and traverses this edge 
+provided it is allowed to do so, \textit{i.e.}, 
 when $\textit{Random}(1)$ is not null. 
 The final configuration is thus outputted.
 This PRNG is formalized in Algorithm~\ref{CI Algorithm}.