From a456fedeff69fa71946d9e85eb2e55f4fc8bedd9 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Wed, 19 Apr 2017 21:08:54 +0300
Subject: [PATCH] Fix grammar

---
 chapter16.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chapter16.tex b/chapter16.tex
index 941b053..83eaf33 100644
--- a/chapter16.tex
+++ b/chapter16.tex
@@ -532,7 +532,7 @@ defines the following graph:
 
 Since each node in a successor graph has a
 unique successor, we can define a function $f(x,k)$
-that returns the node that we will reach if
+that gives the node that we will reach if
 we begin at node $x$ and walk $k$ steps forward.
 For example, in the above graph $f(4,6)=2$,
 because we will reach node 2 by walking 6 steps from node 4: