From e4ae85e1e732546bc0994b425053614c77e0e5b9 Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Wed, 14 Sep 2022 18:02:56 +0200
Subject: Fix typo

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

diff --git a/mgr.tex b/mgr.tex
index f842b9b..295ec12 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -271,7 +271,7 @@ Consider the case of binary trees labeled with $\Sigma$. A
     \item A set of \definedterm{accepting states} $F \subseteq Q$.
     \item A bottom-up \definedterm{transition function} $\delta : Q \times
         \Sigma \times Q \to Q$.
-    \item An \definedterm{initializatoin function} $\iota : \Sigma \to Q$.
+    \item An \definedterm{initialization function} $\iota : \Sigma \to Q$.
 \end{itemize}
 
 A \definedterm{run} of tree automaton $A$ over tree $T$ is a relabeling of $T$
-- 
cgit v1.2.3