m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2022-09-14 18:02:56 +0200
committerMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2022-09-14 18:02:56 +0200
commite4ae85e1e732546bc0994b425053614c77e0e5b9 (patch)
treeddb6d6b0cbc12f120c0caba69753eb636f5601aa
parentfe426a9b9c217f7854597eb3e55e15a97d756f19 (diff)
Fix typo
-rw-r--r--mgr.tex2
1 files changed, 1 insertions, 1 deletions
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$