Write algorithm for déterminisation
This commit is contained in:
parent
dcfb1734a2
commit
d25c45494a
1 changed files with 25 additions and 0 deletions
|
@ -305,4 +305,29 @@
|
|||
|
||||
\end{enumerate}
|
||||
|
||||
Algorithme~:
|
||||
|
||||
\begin{itemize}
|
||||
\item $Q' \leftarrow \{I\}$ \\
|
||||
$I' \leftarrow \{I\}$ \\
|
||||
$\text{marque}(I) = \text{à traiter}$
|
||||
|
||||
\item $\text{tant que } \{e' \in Q' \,|\, \text{marque}(e') = \text{à traiter}\} \neq \oslash$ \\
|
||||
$\text{choisir } p' \in Q' \,|\, \text{marque}(p') = \text{à traiter}$
|
||||
|
||||
\begin{itemize}
|
||||
|
||||
\item $\forall x \in A$ \\
|
||||
Soit $q' = \{q \in Q \,|\, \exists \, p \in p', (p,x,q) \in E\}$ \\
|
||||
$q' \notin Q' \implies (Q' \leftarrow Q' \cup \{q'\}, \text{marque}(q') = \text{à traiter})$ \\
|
||||
$E' \leftarrow E' \cup \{(p',x,q')\}$
|
||||
|
||||
\item $\text{marque}(p') = \text{déjà traité}$
|
||||
|
||||
\end{itemize}
|
||||
|
||||
\item $T' = \{p' \in Q' \,|\, \exists \, p \in p', p \in T\}$
|
||||
|
||||
\end{itemize}
|
||||
|
||||
\end{document}
|
||||
|
|
Loading…
Reference in a new issue