diff options
| -rw-r--r-- | mgr.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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$ |