In this thesis, we look at walks with short steps confined to the first quadrant. We take a look at how many different walks there are depending on the set of available steps. For each set of steps $S$, we try to find the generating function in three variables $x$, $y$ and $t$ which tells us how many $n$ step walks are there starting from $(0, 0)$ and ending at $(i, j)$, using only the steps from set $S$ and never leaving the first quadrant. We also determine whether a given generating function is $D$-finite or algebraic.
|